./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/eureka_01-2.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 fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:17:27,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:17:27,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:17:27,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:17:27,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:17:27,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:17:27,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:17:27,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:17:27,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:17:27,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:17:27,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:17:27,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:17:27,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:17:27,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:17:27,393 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:17:27,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:17:27,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:17:27,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:17:27,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:17:27,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:17:27,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:17:27,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:17:27,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:17:27,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:17:27,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:17:27,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:17:27,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:17:27,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:17:27,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:17:27,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:17:27,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:17:27,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:17:27,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:17:27,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:17:27,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:17:27,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:17:27,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:17:27,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:17:27,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:17:27,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:17:27,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:17:27,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:17:27,412 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 -> fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:17:27,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:17:27,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:17:27,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:17:27,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:17:27,716 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:17:27,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/eureka_01-2.c [2024-09-25 10:17:29,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:17:29,277 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:17:29,277 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/eureka_01-2.c [2024-09-25 10:17:29,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/064b6960d/6c298f7a2b204d238492cab837883e0d/FLAG77d119fcb [2024-09-25 10:17:29,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/064b6960d/6c298f7a2b204d238492cab837883e0d [2024-09-25 10:17:29,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:17:29,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:17:29,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:17:29,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:17:29,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:17:29,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e30c59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29, skipping insertion in model container [2024-09-25 10:17:29,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:17:29,447 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/loops/eureka_01-2.c[323,336] [2024-09-25 10:17:29,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:17:29,488 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:17:29,498 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/loops/eureka_01-2.c[323,336] [2024-09-25 10:17:29,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:17:29,534 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:17:29,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29 WrapperNode [2024-09-25 10:17:29,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:17:29,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:17:29,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:17:29,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:17:29,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,569 INFO L138 Inliner]: procedures = 13, calls = 100, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:17:29,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:17:29,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:17:29,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:17:29,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:17:29,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,601 INFO L175 MemorySlicer]: Split 78 memory accesses to 5 slices as follows [2, 23, 22, 22, 9]. 29 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 20, 20, 20, 0]. The 3 writes are split as follows [0, 0, 0, 0, 3]. [2024-09-25 10:17:29,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:17:29,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:17:29,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:17:29,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:17:29,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (1/1) ... [2024-09-25 10:17:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:17:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:29,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:17:29,660 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:17:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:17:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:17:29,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:17:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:17:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 10:17:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 10:17:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 10:17:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 10:17:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 10:17:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:17:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:17:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:17:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 10:17:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 10:17:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 10:17:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 10:17:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 10:17:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:17:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:17:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 10:17:29,762 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:17:29,763 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:17:30,013 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-09-25 10:17:30,014 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:17:30,035 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:17:30,036 INFO L317 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-25 10:17:30,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:17:30 BoogieIcfgContainer [2024-09-25 10:17:30,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:17:30,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:17:30,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:17:30,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:17:30,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:17:29" (1/3) ... [2024-09-25 10:17:30,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76df6c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:17:30, skipping insertion in model container [2024-09-25 10:17:30,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:17:29" (2/3) ... [2024-09-25 10:17:30,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76df6c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:17:30, skipping insertion in model container [2024-09-25 10:17:30,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:17:30" (3/3) ... [2024-09-25 10:17:30,046 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2024-09-25 10:17:30,060 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:17:30,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:17:30,115 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:17:30,122 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;@12e4d1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:17:30,122 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:17:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:17:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:17:30,136 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:30,136 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:30,137 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:30,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 765619845, now seen corresponding path program 1 times [2024-09-25 10:17:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311925407] [2024-09-25 10:17:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:17:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311925407] [2024-09-25 10:17:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311925407] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:17:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:17:30,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322033031] [2024-09-25 10:17:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:30,376 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:17:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:30,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:17:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:17:30,397 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:30,504 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2024-09-25 10:17:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:17:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:17:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:30,512 INFO L225 Difference]: With dead ends: 56 [2024-09-25 10:17:30,513 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 10:17:30,518 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:17:30,520 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:30,521 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 10:17:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 10:17:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-25 10:17:30,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2024-09-25 10:17:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:30,561 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-25 10:17:30,561 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:30,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-25 10:17:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:17:30,563 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:30,563 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:30,563 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:17:30,563 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:30,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1688893081, now seen corresponding path program 1 times [2024-09-25 10:17:30,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:30,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010330009] [2024-09-25 10:17:30,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:17:30,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010330009] [2024-09-25 10:17:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010330009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:30,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:17:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:17:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365561365] [2024-09-25 10:17:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:30,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:17:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:17:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:17:30,727 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:30,803 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-09-25 10:17:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:17:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:17:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:30,804 INFO L225 Difference]: With dead ends: 49 [2024-09-25 10:17:30,804 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 10:17:30,804 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:17:30,805 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:30,805 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 10:17:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-09-25 10:17:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-25 10:17:30,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2024-09-25 10:17:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:30,816 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-25 10:17:30,816 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:30,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-25 10:17:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:17:30,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:30,818 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:30,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:17:30,818 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:30,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1747889571, now seen corresponding path program 1 times [2024-09-25 10:17:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133971340] [2024-09-25 10:17:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:17:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133971340] [2024-09-25 10:17:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133971340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:30,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:17:30,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:17:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963000249] [2024-09-25 10:17:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:30,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:17:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:17:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:17:30,956 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:31,096 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-09-25 10:17:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:17:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:17:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:31,098 INFO L225 Difference]: With dead ends: 53 [2024-09-25 10:17:31,098 INFO L226 Difference]: Without dead ends: 40 [2024-09-25 10:17:31,098 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:17:31,099 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 83 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:31,099 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 7 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-25 10:17:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2024-09-25 10:17:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-25 10:17:31,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 19 [2024-09-25 10:17:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:31,117 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-25 10:17:31,117 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-25 10:17:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:17:31,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:31,118 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:31,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:17:31,119 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:31,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1285563913, now seen corresponding path program 1 times [2024-09-25 10:17:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034552298] [2024-09-25 10:17:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:17:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034552298] [2024-09-25 10:17:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034552298] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:17:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:17:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139229731] [2024-09-25 10:17:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:31,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:17:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:17:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:17:31,245 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:31,343 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-09-25 10:17:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:17:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:17:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:31,344 INFO L225 Difference]: With dead ends: 50 [2024-09-25 10:17:31,346 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:17:31,346 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:17:31,347 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:31,350 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:17:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 10:17:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-09-25 10:17:31,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 22 [2024-09-25 10:17:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:31,368 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-09-25 10:17:31,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-09-25 10:17:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:17:31,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:31,370 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:31,370 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:17:31,370 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:31,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1170342884, now seen corresponding path program 1 times [2024-09-25 10:17:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390405823] [2024-09-25 10:17:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390405823] [2024-09-25 10:17:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390405823] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:31,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:17:31,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:17:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263445733] [2024-09-25 10:17:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:31,471 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:17:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:17:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:17:31,472 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:31,594 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-09-25 10:17:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:17:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-25 10:17:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:31,595 INFO L225 Difference]: With dead ends: 49 [2024-09-25 10:17:31,595 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 10:17:31,595 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:17:31,597 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:31,598 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 10:17:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-09-25 10:17:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-25 10:17:31,610 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2024-09-25 10:17:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:31,611 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-25 10:17:31,611 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:31,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-25 10:17:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:17:31,613 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:31,613 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:31,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:17:31,616 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:31,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash -466136846, now seen corresponding path program 1 times [2024-09-25 10:17:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:31,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221200627] [2024-09-25 10:17:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:31,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221200627] [2024-09-25 10:17:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221200627] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804922354] [2024-09-25 10:17:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:31,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:31,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:31,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:17:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:31,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:17:31,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:31,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:31,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804922354] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:31,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:31,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-09-25 10:17:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026155643] [2024-09-25 10:17:31,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:31,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:17:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:31,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:17:31,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:17:31,977 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:32,131 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-09-25 10:17:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:17:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-09-25 10:17:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:32,132 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:17:32,132 INFO L226 Difference]: Without dead ends: 40 [2024-09-25 10:17:32,133 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:17:32,133 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:32,134 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 19 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-25 10:17:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-25 10:17:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-09-25 10:17:32,143 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 27 [2024-09-25 10:17:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:32,143 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-09-25 10:17:32,144 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:32,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2024-09-25 10:17:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:17:32,145 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:32,145 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] [2024-09-25 10:17:32,158 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:17:32,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:17:32,350 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:32,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2081475630, now seen corresponding path program 2 times [2024-09-25 10:17:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403553202] [2024-09-25 10:17:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:32,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:17:32,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403553202] [2024-09-25 10:17:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403553202] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410006208] [2024-09-25 10:17:32,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:17:32,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:32,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:32,461 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:17:32,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:17:32,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:32,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:17:32,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:17:32,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:17:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410006208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:17:32,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:17:32,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-09-25 10:17:32,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545171718] [2024-09-25 10:17:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:17:32,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:17:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:32,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:17:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:17:32,592 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:32,636 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-09-25 10:17:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:17:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-09-25 10:17:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:32,637 INFO L225 Difference]: With dead ends: 70 [2024-09-25 10:17:32,637 INFO L226 Difference]: Without dead ends: 40 [2024-09-25 10:17:32,637 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:17:32,638 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:32,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:17:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-25 10:17:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-25 10:17:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-25 10:17:32,649 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 36 [2024-09-25 10:17:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:32,651 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-25 10:17:32,651 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:32,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-25 10:17:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:17:32,653 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:32,653 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-09-25 10:17:32,669 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:17:32,854 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:17:32,855 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:32,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1575312, now seen corresponding path program 1 times [2024-09-25 10:17:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205394641] [2024-09-25 10:17:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:33,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205394641] [2024-09-25 10:17:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205394641] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993159365] [2024-09-25 10:17:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:33,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:33,029 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:17:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:33,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:17:33,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:33,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:17:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993159365] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:33,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-09-25 10:17:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346506533] [2024-09-25 10:17:33,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:33,290 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:17:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:17:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:17:33,292 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:33,448 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-09-25 10:17:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:17:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-09-25 10:17:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:33,449 INFO L225 Difference]: With dead ends: 67 [2024-09-25 10:17:33,449 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 10:17:33,449 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:17:33,450 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:33,450 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 16 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 10:17:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-25 10:17:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-09-25 10:17:33,458 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 36 [2024-09-25 10:17:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:33,458 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-09-25 10:17:33,458 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:33,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-09-25 10:17:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 10:17:33,459 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:33,459 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 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] [2024-09-25 10:17:33,473 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:17:33,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:17:33,661 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:33,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1534550158, now seen corresponding path program 2 times [2024-09-25 10:17:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:33,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080679432] [2024-09-25 10:17:33,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:33,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:33,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:17:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080679432] [2024-09-25 10:17:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080679432] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672077527] [2024-09-25 10:17:33,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:17:33,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:33,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:33,745 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:17:33,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:17:33,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:33,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:17:33,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:17:33,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:17:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672077527] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:33,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-25 10:17:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343062041] [2024-09-25 10:17:33,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:33,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:17:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:17:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:17:33,984 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:34,124 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-09-25 10:17:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:17:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-09-25 10:17:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:34,126 INFO L225 Difference]: With dead ends: 72 [2024-09-25 10:17:34,126 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 10:17:34,127 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:17:34,127 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:34,127 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 10 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 10:17:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-25 10:17:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-09-25 10:17:34,144 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 39 [2024-09-25 10:17:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:34,145 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-09-25 10:17:34,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:34,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-09-25 10:17:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-25 10:17:34,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:34,146 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 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] [2024-09-25 10:17:34,166 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:17:34,347 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:34,347 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:34,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -217673339, now seen corresponding path program 3 times [2024-09-25 10:17:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901753436] [2024-09-25 10:17:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:34,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:17:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901753436] [2024-09-25 10:17:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901753436] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615903316] [2024-09-25 10:17:34,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:17:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:34,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:34,537 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:17:34,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:17:34,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:34,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:17:34,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-25 10:17:34,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-25 10:17:34,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615903316] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:34,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:34,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2024-09-25 10:17:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125355315] [2024-09-25 10:17:34,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:34,760 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:17:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:17:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:17:34,762 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:35,331 INFO L93 Difference]: Finished difference Result 163 states and 215 transitions. [2024-09-25 10:17:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-25 10:17:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-25 10:17:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:35,333 INFO L225 Difference]: With dead ends: 163 [2024-09-25 10:17:35,333 INFO L226 Difference]: Without dead ends: 134 [2024-09-25 10:17:35,334 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1317, Unknown=0, NotChecked=0, Total=1980 [2024-09-25 10:17:35,335 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 526 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:35,335 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 19 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:17:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-25 10:17:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2024-09-25 10:17:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2024-09-25 10:17:35,360 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 48 [2024-09-25 10:17:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:35,360 INFO L474 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2024-09-25 10:17:35,360 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:35,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2024-09-25 10:17:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-09-25 10:17:35,362 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:35,362 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:35,380 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 10:17:35,562 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:17:35,563 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:35,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1562879381, now seen corresponding path program 4 times [2024-09-25 10:17:35,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:35,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224969226] [2024-09-25 10:17:35,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:35,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 262 proven. 35 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-09-25 10:17:35,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:35,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224969226] [2024-09-25 10:17:35,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224969226] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303580356] [2024-09-25 10:17:35,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:17:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:35,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:35,877 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:17:36,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:17:36,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:36,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:17:36,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 26 proven. 227 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-09-25 10:17:36,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 26 proven. 227 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-09-25 10:17:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303580356] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:36,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:36,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2024-09-25 10:17:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653601757] [2024-09-25 10:17:36,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:36,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 10:17:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 10:17:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:17:36,411 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:37,549 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2024-09-25 10:17:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-25 10:17:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-09-25 10:17:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:37,551 INFO L225 Difference]: With dead ends: 284 [2024-09-25 10:17:37,551 INFO L226 Difference]: Without dead ends: 212 [2024-09-25 10:17:37,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=4995, Unknown=0, NotChecked=0, Total=6480 [2024-09-25 10:17:37,553 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:37,553 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 25 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:17:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-09-25 10:17:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 131. [2024-09-25 10:17:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.264) internal successors, (158), 125 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2024-09-25 10:17:37,577 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 107 [2024-09-25 10:17:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:37,578 INFO L474 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2024-09-25 10:17:37,578 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:37,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2024-09-25 10:17:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-25 10:17:37,579 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:37,579 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:37,596 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:17:37,783 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:17:37,784 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:37,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 583062961, now seen corresponding path program 5 times [2024-09-25 10:17:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059709877] [2024-09-25 10:17:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:38,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-09-25 10:17:38,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:38,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059709877] [2024-09-25 10:17:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059709877] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:38,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633955682] [2024-09-25 10:17:38,056 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:17:38,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:38,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:38,057 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:38,059 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:17:55,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2024-09-25 10:17:55,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:55,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:17:55,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 614 proven. 51 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-09-25 10:17:55,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 493 proven. 172 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-09-25 10:17:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633955682] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:55,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-09-25 10:17:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794503615] [2024-09-25 10:17:55,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:55,894 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 10:17:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 10:17:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2024-09-25 10:17:55,896 INFO L87 Difference]: Start difference. First operand 131 states and 163 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:17:56,195 INFO L93 Difference]: Finished difference Result 316 states and 435 transitions. [2024-09-25 10:17:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:17:56,196 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2024-09-25 10:17:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:17:56,197 INFO L225 Difference]: With dead ends: 316 [2024-09-25 10:17:56,197 INFO L226 Difference]: Without dead ends: 227 [2024-09-25 10:17:56,198 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=574, Invalid=1066, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 10:17:56,198 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:17:56,198 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 16 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:17:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-09-25 10:17:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-09-25 10:17:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 221 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:17:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 291 transitions. [2024-09-25 10:17:56,245 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 291 transitions. Word has length 127 [2024-09-25 10:17:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:17:56,246 INFO L474 AbstractCegarLoop]: Abstraction has 227 states and 291 transitions. [2024-09-25 10:17:56,246 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:17:56,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2024-09-25 10:17:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-09-25 10:17:56,248 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:17:56,248 INFO L216 NwaCegarLoop]: trace histogram [56, 56, 56, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:17:56,270 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:17:56,448 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:56,449 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:17:56,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:17:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash 790417841, now seen corresponding path program 6 times [2024-09-25 10:17:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:17:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693415431] [2024-09-25 10:17:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:17:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:17:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:57,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:17:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:17:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 1855 proven. 287 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2024-09-25 10:17:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:17:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693415431] [2024-09-25 10:17:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693415431] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:17:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250504871] [2024-09-25 10:17:57,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:17:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:17:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:17:57,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:17:57,164 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:17:58,285 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-09-25 10:17:58,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:17:58,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:17:58,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:17:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4901 trivial. 0 not checked. [2024-09-25 10:17:58,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:17:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4901 trivial. 0 not checked. [2024-09-25 10:17:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250504871] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:17:58,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:17:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 34 [2024-09-25 10:17:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433820567] [2024-09-25 10:17:58,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:17:58,797 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-25 10:17:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:17:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-25 10:17:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 10:17:58,798 INFO L87 Difference]: Start difference. First operand 227 states and 291 transitions. Second operand has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:18:06,726 INFO L93 Difference]: Finished difference Result 1002 states and 1350 transitions. [2024-09-25 10:18:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2024-09-25 10:18:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 223 [2024-09-25 10:18:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:18:06,733 INFO L225 Difference]: With dead ends: 1002 [2024-09-25 10:18:06,734 INFO L226 Difference]: Without dead ends: 841 [2024-09-25 10:18:06,743 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29015 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=21038, Invalid=53764, Unknown=0, NotChecked=0, Total=74802 [2024-09-25 10:18:06,743 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 3828 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3829 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:18:06,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3829 Valid, 34 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:18:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-09-25 10:18:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 255. [2024-09-25 10:18:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 249 states have (on average 1.2771084337349397) internal successors, (318), 249 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:18:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 323 transitions. [2024-09-25 10:18:06,808 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 323 transitions. Word has length 223 [2024-09-25 10:18:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:18:06,808 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 323 transitions. [2024-09-25 10:18:06,808 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:06,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 323 transitions. [2024-09-25 10:18:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-09-25 10:18:06,811 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:18:06,811 INFO L216 NwaCegarLoop]: trace histogram [60, 60, 60, 14, 14, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:18:06,826 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:18:07,011 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:18:07,012 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:18:07,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1735881021, now seen corresponding path program 7 times [2024-09-25 10:18:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:18:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925115753] [2024-09-25 10:18:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:18:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:18:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:07,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:18:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-25 10:18:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:18:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925115753] [2024-09-25 10:18:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925115753] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:18:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094956176] [2024-09-25 10:18:07,783 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:18:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:18:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:18:07,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:18:07,786 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:18:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:08,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:18:08,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:18:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-25 10:18:08,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:18:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-25 10:18:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094956176] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:18:08,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:18:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 41 [2024-09-25 10:18:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287874232] [2024-09-25 10:18:08,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:18:08,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 10:18:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:18:08,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 10:18:08,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 10:18:08,559 INFO L87 Difference]: Start difference. First operand 255 states and 323 transitions. Second operand has 41 states, 41 states have (on average 3.4146341463414633) internal successors, (140), 40 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:18:09,039 INFO L93 Difference]: Finished difference Result 501 states and 659 transitions. [2024-09-25 10:18:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:18:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.4146341463414633) internal successors, (140), 40 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 251 [2024-09-25 10:18:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:18:09,042 INFO L225 Difference]: With dead ends: 501 [2024-09-25 10:18:09,042 INFO L226 Difference]: Without dead ends: 315 [2024-09-25 10:18:09,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 471 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1300, Invalid=2482, Unknown=0, NotChecked=0, Total=3782 [2024-09-25 10:18:09,043 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 221 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:18:09,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 22 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:18:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-09-25 10:18:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-09-25 10:18:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 309 states have (on average 1.2880258899676376) internal successors, (398), 309 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:18:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 403 transitions. [2024-09-25 10:18:09,108 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 403 transitions. Word has length 251 [2024-09-25 10:18:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:18:09,108 INFO L474 AbstractCegarLoop]: Abstraction has 315 states and 403 transitions. [2024-09-25 10:18:09,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.4146341463414633) internal successors, (140), 40 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:09,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 403 transitions. [2024-09-25 10:18:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-09-25 10:18:09,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:18:09,111 INFO L216 NwaCegarLoop]: trace histogram [80, 80, 80, 14, 14, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:18:09,127 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:18:09,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:18:09,314 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:18:09,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1724060895, now seen corresponding path program 8 times [2024-09-25 10:18:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:18:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347079812] [2024-09-25 10:18:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:18:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:18:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:09,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:18:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-25 10:18:09,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:18:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347079812] [2024-09-25 10:18:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347079812] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:18:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780138176] [2024-09-25 10:18:09,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:18:09,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:18:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:18:09,944 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:18:09,945 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:18:10,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:18:10,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:18:10,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 1934 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:18:10,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:18:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-25 10:18:10,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:18:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-25 10:18:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780138176] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:18:11,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:18:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-09-25 10:18:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947696227] [2024-09-25 10:18:11,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:18:11,163 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 10:18:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:18:11,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 10:18:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:18:11,164 INFO L87 Difference]: Start difference. First operand 315 states and 403 transitions. Second operand has 20 states, 20 states have (on average 5.05) internal successors, (101), 19 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:18:11,464 INFO L93 Difference]: Finished difference Result 431 states and 546 transitions. [2024-09-25 10:18:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:18:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 19 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 311 [2024-09-25 10:18:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:18:11,466 INFO L225 Difference]: With dead ends: 431 [2024-09-25 10:18:11,467 INFO L226 Difference]: Without dead ends: 391 [2024-09-25 10:18:11,469 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2024-09-25 10:18:11,469 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 288 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:18:11,470 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 16 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:18:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-09-25 10:18:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 378. [2024-09-25 10:18:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 372 states have (on average 1.2956989247311828) internal successors, (482), 372 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:18:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 487 transitions. [2024-09-25 10:18:11,604 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 487 transitions. Word has length 311 [2024-09-25 10:18:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:18:11,605 INFO L474 AbstractCegarLoop]: Abstraction has 378 states and 487 transitions. [2024-09-25 10:18:11,605 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 19 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:18:11,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 487 transitions. [2024-09-25 10:18:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-09-25 10:18:11,608 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:18:11,608 INFO L216 NwaCegarLoop]: trace histogram [100, 100, 100, 14, 14, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:18:11,625 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 10:18:11,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 10:18:11,810 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:18:11,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:18:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 416411771, now seen corresponding path program 9 times [2024-09-25 10:18:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:18:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941246159] [2024-09-25 10:18:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:18:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:18:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:12,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:18:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:18:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2024-09-25 10:18:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:18:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941246159] [2024-09-25 10:18:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941246159] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:18:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926136192] [2024-09-25 10:18:12,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:18:12,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:18:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:18:12,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:18:12,993 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:18:13,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-25 10:18:13,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:18:13,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-25 10:18:13,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:18:13,536 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 19 treesize of output 1 [2024-09-25 10:18:13,644 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 35 treesize of output 19 [2024-09-25 10:18:13,893 INFO L349 Elim1Store]: treesize reduction 86, result has 28.3 percent of original size [2024-09-25 10:18:13,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 54 [2024-09-25 10:18:13,983 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 15 treesize of output 7 [2024-09-25 10:18:13,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 10:18:13,991 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 34 treesize of output 10 [2024-09-25 10:18:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 506 proven. 37 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-09-25 10:18:14,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:18:48,406 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 142 treesize of output 134 [2024-09-25 10:18:48,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 10:18:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80078 treesize of output 70142 [2024-09-25 10:19:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 506 proven. 37 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-09-25 10:19:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926136192] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:19:13,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:19:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 14] total 42 [2024-09-25 10:19:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708528978] [2024-09-25 10:19:13,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:19:13,671 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-25 10:19:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:19:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-25 10:19:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1490, Unknown=8, NotChecked=0, Total=1722 [2024-09-25 10:19:13,672 INFO L87 Difference]: Start difference. First operand 378 states and 487 transitions. Second operand has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 41 states have internal predecessors, (110), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:19:28,653 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 [1] [2024-09-25 10:19:32,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:19:37,141 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 [1] [2024-09-25 10:19:41,164 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 [1] [2024-09-25 10:19:45,238 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 [1] [2024-09-25 10:19:50,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:19:54,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:12,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:23,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:27,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:38,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:42,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:20:46,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:21:01,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:21:14,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:21:19,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 10:21:36,757 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 [1] [2024-09-25 10:21:54,902 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 [1] [2024-09-25 10:21:58,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]