./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 18:15:53,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:15:53,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:15:53,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:15:53,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:15:53,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:15:53,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:15:53,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:15:53,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:15:53,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:15:53,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:15:53,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:15:53,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:15:53,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:15:53,310 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:15:53,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:15:53,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:15:53,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:15:53,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:15:53,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:15:53,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:15:53,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:15:53,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:15:53,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:15:53,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:15:53,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:15:53,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:15:53,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:15:53,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:15:53,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:15:53,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:15:53,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:15:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:15:53,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:15:53,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:15:53,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:15:53,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:15:53,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:15:53,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:15:53,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:15:53,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:15:53,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:15:53,320 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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 18:15:53,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:15:53,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:15:53,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:15:53,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:15:53,648 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:15:53,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-17 18:15:55,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:15:55,356 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:15:55,356 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-17 18:15:55,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1b8ec2778/a80f5ea59e34477c95ae8dada786e432/FLAG9cc638a19 [2024-09-17 18:15:55,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1b8ec2778/a80f5ea59e34477c95ae8dada786e432 [2024-09-17 18:15:55,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:15:55,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:15:55,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:15:55,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:15:55,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:15:55,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123205ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55, skipping insertion in model container [2024-09-17 18:15:55,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:15:55,596 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-17 18:15:55,605 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-17 18:15:55,607 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-17 18:15:55,613 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-17 18:15:55,617 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-17 18:15:55,618 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-17 18:15:55,621 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-17 18:15:55,623 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-17 18:15:55,626 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-17 18:15:55,628 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-17 18:15:55,632 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-17 18:15:55,634 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-17 18:15:55,637 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-17 18:15:55,639 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-17 18:15:55,640 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-17 18:15:55,642 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-17 18:15:55,643 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-17 18:15:55,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:15:55,657 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:15:55,672 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-17 18:15:55,673 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-17 18:15:55,674 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-17 18:15:55,676 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-17 18:15:55,678 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-17 18:15:55,679 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-17 18:15:55,681 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-17 18:15:55,682 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-17 18:15:55,683 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-17 18:15:55,685 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-17 18:15:55,687 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-17 18:15:55,688 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-17 18:15:55,690 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-17 18:15:55,692 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-17 18:15:55,694 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-17 18:15:55,696 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-17 18:15:55,697 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-17 18:15:55,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:15:55,721 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:15:55,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55 WrapperNode [2024-09-17 18:15:55,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:15:55,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:15:55,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:15:55,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:15:55,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,757 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:15:55,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:15:55,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:15:55,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:15:55,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:15:55,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-17 18:15:55,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:15:55,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:15:55,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:15:55,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:15:55,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (1/1) ... [2024-09-17 18:15:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:15:55,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:15:55,904 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-17 18:15:55,909 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-17 18:15:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:15:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:15:55,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:15:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:15:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:15:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:15:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:15:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:15:56,044 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:15:56,046 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:15:56,384 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-09-17 18:15:56,384 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:15:56,407 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:15:56,407 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 18:15:56,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:15:56 BoogieIcfgContainer [2024-09-17 18:15:56,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:15:56,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:15:56,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:15:56,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:15:56,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:15:55" (1/3) ... [2024-09-17 18:15:56,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f314e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:15:56, skipping insertion in model container [2024-09-17 18:15:56,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:15:55" (2/3) ... [2024-09-17 18:15:56,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f314e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:15:56, skipping insertion in model container [2024-09-17 18:15:56,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:15:56" (3/3) ... [2024-09-17 18:15:56,421 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2024-09-17 18:15:56,438 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:15:56,439 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-09-17 18:15:56,512 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:15:56,518 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;@2f964f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:15:56,518 INFO L337 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-09-17 18:15:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 18:15:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-17 18:15:56,536 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:56,537 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:56,539 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:56,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2024-09-17 18:15:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:56,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643934818] [2024-09-17 18:15:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:56,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:57,021 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-17 18:15:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643934818] [2024-09-17 18:15:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643934818] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:57,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:15:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741274218] [2024-09-17 18:15:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:57,030 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:15:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:15:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:15:57,058 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:57,366 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-09-17 18:15:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:15:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-17 18:15:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:57,378 INFO L225 Difference]: With dead ends: 91 [2024-09-17 18:15:57,378 INFO L226 Difference]: Without dead ends: 76 [2024-09-17 18:15:57,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:15:57,386 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:57,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 18:15:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-17 18:15:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2024-09-17 18:15:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-17 18:15:57,442 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2024-09-17 18:15:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:57,444 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-17 18:15:57,445 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-17 18:15:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-17 18:15:57,448 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:57,448 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:57,448 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:15:57,449 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:57,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2024-09-17 18:15:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016148396] [2024-09-17 18:15:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:57,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:57,567 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-17 18:15:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016148396] [2024-09-17 18:15:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016148396] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:15:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079923160] [2024-09-17 18:15:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:57,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:15:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:15:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:15:57,574 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:57,781 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-17 18:15:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:15:57,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-17 18:15:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:57,783 INFO L225 Difference]: With dead ends: 68 [2024-09-17 18:15:57,783 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 18:15:57,785 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:15:57,787 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:57,788 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 90 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 18:15:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 18:15:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-17 18:15:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-17 18:15:57,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2024-09-17 18:15:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:57,813 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-17 18:15:57,814 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:57,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-17 18:15:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-17 18:15:57,817 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:57,817 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:57,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:15:57,818 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:57,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2024-09-17 18:15:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000002557] [2024-09-17 18:15:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:57,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:57,933 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-17 18:15:57,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000002557] [2024-09-17 18:15:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000002557] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:57,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:57,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:15:57,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502545488] [2024-09-17 18:15:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:57,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:15:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:15:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:15:57,941 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:58,073 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-17 18:15:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:15:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-17 18:15:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:58,075 INFO L225 Difference]: With dead ends: 72 [2024-09-17 18:15:58,075 INFO L226 Difference]: Without dead ends: 70 [2024-09-17 18:15:58,076 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:15:58,077 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:58,080 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-17 18:15:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-09-17 18:15:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-09-17 18:15:58,100 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2024-09-17 18:15:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:58,101 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-09-17 18:15:58,101 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-09-17 18:15:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-17 18:15:58,102 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:58,102 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:58,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 18:15:58,103 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:58,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2024-09-17 18:15:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118362619] [2024-09-17 18:15:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,203 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-17 18:15:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118362619] [2024-09-17 18:15:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118362619] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:15:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502698318] [2024-09-17 18:15:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:58,204 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:15:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:15:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:58,205 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:58,369 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-17 18:15:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:15:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-17 18:15:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:58,372 INFO L225 Difference]: With dead ends: 70 [2024-09-17 18:15:58,372 INFO L226 Difference]: Without dead ends: 68 [2024-09-17 18:15:58,373 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:15:58,373 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:58,374 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-17 18:15:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-17 18:15:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-09-17 18:15:58,387 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2024-09-17 18:15:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:58,388 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-09-17 18:15:58,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-09-17 18:15:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-17 18:15:58,390 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:58,390 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:58,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-17 18:15:58,391 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:58,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2024-09-17 18:15:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733580116] [2024-09-17 18:15:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,464 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-17 18:15:58,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:58,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733580116] [2024-09-17 18:15:58,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733580116] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:58,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:58,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:15:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092872080] [2024-09-17 18:15:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:58,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:15:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:15:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:58,467 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:58,634 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-17 18:15:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:15:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-17 18:15:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:58,635 INFO L225 Difference]: With dead ends: 68 [2024-09-17 18:15:58,636 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 18:15:58,636 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:15:58,637 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:58,637 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 117 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 18:15:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-09-17 18:15:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-09-17 18:15:58,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2024-09-17 18:15:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:58,649 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-09-17 18:15:58,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-09-17 18:15:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-17 18:15:58,650 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:58,650 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:58,650 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-17 18:15:58,650 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:58,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2024-09-17 18:15:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:58,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527505984] [2024-09-17 18:15:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:58,746 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-17 18:15:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527505984] [2024-09-17 18:15:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527505984] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:15:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947192209] [2024-09-17 18:15:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:58,747 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:15:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:58,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:15:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:58,748 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:58,921 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-17 18:15:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:15:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-17 18:15:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:58,923 INFO L225 Difference]: With dead ends: 66 [2024-09-17 18:15:58,923 INFO L226 Difference]: Without dead ends: 64 [2024-09-17 18:15:58,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:15:58,924 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:58,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 111 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-17 18:15:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-09-17 18:15:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-09-17 18:15:58,937 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2024-09-17 18:15:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:58,940 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-09-17 18:15:58,940 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:58,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-09-17 18:15:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-17 18:15:58,941 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:58,941 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:58,942 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-17 18:15:58,942 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:58,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2024-09-17 18:15:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741962936] [2024-09-17 18:15:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,023 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-17 18:15:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741962936] [2024-09-17 18:15:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741962936] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:15:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439685273] [2024-09-17 18:15:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:59,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:15:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:15:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:15:59,027 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:59,152 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-17 18:15:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:15:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-17 18:15:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:59,154 INFO L225 Difference]: With dead ends: 64 [2024-09-17 18:15:59,154 INFO L226 Difference]: Without dead ends: 60 [2024-09-17 18:15:59,154 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:59,155 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:59,155 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-17 18:15:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-17 18:15:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-09-17 18:15:59,165 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2024-09-17 18:15:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:59,165 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-09-17 18:15:59,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-09-17 18:15:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-17 18:15:59,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:59,166 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:59,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-17 18:15:59,167 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:59,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2024-09-17 18:15:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034789139] [2024-09-17 18:15:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,232 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-17 18:15:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034789139] [2024-09-17 18:15:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034789139] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:59,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:15:59,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429155723] [2024-09-17 18:15:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:59,235 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:15:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:15:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:15:59,237 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:59,348 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-17 18:15:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:15:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-17 18:15:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:59,350 INFO L225 Difference]: With dead ends: 60 [2024-09-17 18:15:59,350 INFO L226 Difference]: Without dead ends: 56 [2024-09-17 18:15:59,350 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:59,351 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:59,351 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-17 18:15:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-17 18:15:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-09-17 18:15:59,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2024-09-17 18:15:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:59,369 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-09-17 18:15:59,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-09-17 18:15:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-17 18:15:59,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:59,370 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:59,370 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-17 18:15:59,371 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:59,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2024-09-17 18:15:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911254020] [2024-09-17 18:15:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,502 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-17 18:15:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911254020] [2024-09-17 18:15:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911254020] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:15:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191329618] [2024-09-17 18:15:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:59,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:15:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:15:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:15:59,506 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:59,671 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-17 18:15:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:15:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-17 18:15:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:59,673 INFO L225 Difference]: With dead ends: 88 [2024-09-17 18:15:59,674 INFO L226 Difference]: Without dead ends: 86 [2024-09-17 18:15:59,674 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:15:59,676 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:59,676 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-17 18:15:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2024-09-17 18:15:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-09-17 18:15:59,691 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2024-09-17 18:15:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:59,692 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-09-17 18:15:59,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-09-17 18:15:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-17 18:15:59,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:59,694 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:59,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-17 18:15:59,695 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:59,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2024-09-17 18:15:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384446924] [2024-09-17 18:15:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,774 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-17 18:15:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384446924] [2024-09-17 18:15:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384446924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:15:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006957074] [2024-09-17 18:15:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:59,776 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:15:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:15:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:59,777 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:15:59,895 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-17 18:15:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:15:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-17 18:15:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:15:59,896 INFO L225 Difference]: With dead ends: 60 [2024-09-17 18:15:59,896 INFO L226 Difference]: Without dead ends: 58 [2024-09-17 18:15:59,897 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:15:59,897 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:15:59,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:15:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-17 18:15:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-17 18:15:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-09-17 18:15:59,909 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 16 [2024-09-17 18:15:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:15:59,911 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-09-17 18:15:59,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:15:59,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-09-17 18:15:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-17 18:15:59,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:15:59,912 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:15:59,912 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-17 18:15:59,912 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:15:59,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:15:59,912 INFO L85 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2024-09-17 18:15:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:15:59,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824455025] [2024-09-17 18:15:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:15:59,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:15:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:15:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:15:59,971 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-17 18:15:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:15:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824455025] [2024-09-17 18:15:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824455025] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:15:59,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:15:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:15:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413339440] [2024-09-17 18:15:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:15:59,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:15:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:15:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:15:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:15:59,974 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:00,093 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-17 18:16:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:16:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-17 18:16:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:00,094 INFO L225 Difference]: With dead ends: 58 [2024-09-17 18:16:00,094 INFO L226 Difference]: Without dead ends: 56 [2024-09-17 18:16:00,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:16:00,095 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:00,095 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 83 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-17 18:16:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-17 18:16:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-09-17 18:16:00,104 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2024-09-17 18:16:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:00,104 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-09-17 18:16:00,104 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-09-17 18:16:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-17 18:16:00,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:00,105 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:00,106 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-17 18:16:00,106 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:00,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2024-09-17 18:16:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:00,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609057728] [2024-09-17 18:16:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,239 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-17 18:16:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609057728] [2024-09-17 18:16:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609057728] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788647071] [2024-09-17 18:16:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:00,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:00,241 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:00,400 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-09-17 18:16:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 18:16:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-17 18:16:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:00,401 INFO L225 Difference]: With dead ends: 78 [2024-09-17 18:16:00,401 INFO L226 Difference]: Without dead ends: 76 [2024-09-17 18:16:00,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:16:00,402 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:00,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 106 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-17 18:16:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2024-09-17 18:16:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-09-17 18:16:00,412 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2024-09-17 18:16:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:00,412 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-09-17 18:16:00,412 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-09-17 18:16:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-17 18:16:00,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:00,414 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:00,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-17 18:16:00,414 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:00,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2024-09-17 18:16:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958404737] [2024-09-17 18:16:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,491 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-17 18:16:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958404737] [2024-09-17 18:16:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958404737] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:16:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963492015] [2024-09-17 18:16:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:00,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:16:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:16:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:16:00,493 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:00,621 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-09-17 18:16:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:16:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-17 18:16:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:00,622 INFO L225 Difference]: With dead ends: 59 [2024-09-17 18:16:00,622 INFO L226 Difference]: Without dead ends: 57 [2024-09-17 18:16:00,623 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:16:00,623 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:00,623 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-17 18:16:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-09-17 18:16:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-09-17 18:16:00,631 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2024-09-17 18:16:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:00,632 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-09-17 18:16:00,632 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-09-17 18:16:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-17 18:16:00,633 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:00,633 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:00,633 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-17 18:16:00,634 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:00,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2024-09-17 18:16:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401993111] [2024-09-17 18:16:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:00,738 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-17 18:16:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401993111] [2024-09-17 18:16:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401993111] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:00,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:00,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297860873] [2024-09-17 18:16:00,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:00,739 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:00,740 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:00,898 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-17 18:16:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-17 18:16:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:00,899 INFO L225 Difference]: With dead ends: 72 [2024-09-17 18:16:00,899 INFO L226 Difference]: Without dead ends: 70 [2024-09-17 18:16:00,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:16:00,901 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:00,901 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-17 18:16:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-09-17 18:16:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-17 18:16:00,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-17 18:16:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:00,912 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-17 18:16:00,912 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:00,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-17 18:16:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-17 18:16:00,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:00,913 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:00,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-17 18:16:00,913 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:00,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2024-09-17 18:16:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661762459] [2024-09-17 18:16:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,040 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-17 18:16:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661762459] [2024-09-17 18:16:01,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661762459] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:01,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:01,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71936229] [2024-09-17 18:16:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:01,041 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:01,042 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:01,193 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-17 18:16:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:01,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-17 18:16:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:01,194 INFO L225 Difference]: With dead ends: 73 [2024-09-17 18:16:01,194 INFO L226 Difference]: Without dead ends: 69 [2024-09-17 18:16:01,195 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-17 18:16:01,195 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:01,195 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 121 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-17 18:16:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-09-17 18:16:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-17 18:16:01,216 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2024-09-17 18:16:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:01,218 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-17 18:16:01,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-17 18:16:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-17 18:16:01,220 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:01,220 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:01,220 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-17 18:16:01,220 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:01,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2024-09-17 18:16:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:01,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273946373] [2024-09-17 18:16:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,341 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-17 18:16:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273946373] [2024-09-17 18:16:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273946373] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769449638] [2024-09-17 18:16:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:01,342 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:01,343 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:01,492 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-17 18:16:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:01,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-17 18:16:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:01,494 INFO L225 Difference]: With dead ends: 69 [2024-09-17 18:16:01,494 INFO L226 Difference]: Without dead ends: 67 [2024-09-17 18:16:01,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:16:01,496 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:01,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-17 18:16:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-17 18:16:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-09-17 18:16:01,511 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 18 [2024-09-17 18:16:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:01,511 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-09-17 18:16:01,511 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-09-17 18:16:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-17 18:16:01,512 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:01,512 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-17 18:16:01,513 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-17 18:16:01,513 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:01,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2024-09-17 18:16:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402546830] [2024-09-17 18:16:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,588 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-17 18:16:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402546830] [2024-09-17 18:16:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402546830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:16:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574932042] [2024-09-17 18:16:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:01,592 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:16:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:16:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:16:01,593 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:01,696 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-09-17 18:16:01,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:16:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-17 18:16:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:01,697 INFO L225 Difference]: With dead ends: 66 [2024-09-17 18:16:01,697 INFO L226 Difference]: Without dead ends: 64 [2024-09-17 18:16:01,697 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:01,697 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:01,698 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 68 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-17 18:16:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-09-17 18:16:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-09-17 18:16:01,709 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 19 [2024-09-17 18:16:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:01,709 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-09-17 18:16:01,709 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-09-17 18:16:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-17 18:16:01,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:01,710 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] [2024-09-17 18:16:01,711 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-17 18:16:01,711 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:01,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2024-09-17 18:16:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100047040] [2024-09-17 18:16:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:01,770 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-17 18:16:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100047040] [2024-09-17 18:16:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100047040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:16:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844502951] [2024-09-17 18:16:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:01,772 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:16:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:16:01,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:16:01,772 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:01,885 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-09-17 18:16:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:16:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-17 18:16:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:01,886 INFO L225 Difference]: With dead ends: 64 [2024-09-17 18:16:01,887 INFO L226 Difference]: Without dead ends: 60 [2024-09-17 18:16:01,887 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:16:01,887 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:01,888 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-17 18:16:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-17 18:16:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-09-17 18:16:01,902 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 20 [2024-09-17 18:16:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:01,902 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-09-17 18:16:01,902 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:01,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-09-17 18:16:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-17 18:16:01,904 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:01,904 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:01,904 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-17 18:16:01,904 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:01,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 911253964, now seen corresponding path program 1 times [2024-09-17 18:16:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693643541] [2024-09-17 18:16:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:02,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:16:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693643541] [2024-09-17 18:16:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693643541] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:16:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330462288] [2024-09-17 18:16:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:16:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:16:02,045 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-17 18:16:02,047 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-17 18:16:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:02,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-17 18:16:02,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:16:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:16:02,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:16:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-17 18:16:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330462288] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:16:02,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:16:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-17 18:16:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256963024] [2024-09-17 18:16:02,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:16:02,471 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-17 18:16:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-17 18:16:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-17 18:16:02,472 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 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-17 18:16:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:02,754 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-17 18:16:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-17 18:16:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 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 21 [2024-09-17 18:16:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:02,755 INFO L225 Difference]: With dead ends: 86 [2024-09-17 18:16:02,755 INFO L226 Difference]: Without dead ends: 84 [2024-09-17 18:16:02,756 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-17 18:16:02,756 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 407 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:02,756 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 113 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 18:16:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-17 18:16:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2024-09-17 18:16:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-09-17 18:16:02,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2024-09-17 18:16:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:02,769 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-09-17 18:16:02,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 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-17 18:16:02,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-09-17 18:16:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-17 18:16:02,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:02,770 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] [2024-09-17 18:16:02,788 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 18:16:02,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:16:02,971 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:02,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1524331500, now seen corresponding path program 1 times [2024-09-17 18:16:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520521576] [2024-09-17 18:16:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,086 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-17 18:16:03,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:03,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520521576] [2024-09-17 18:16:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520521576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313226509] [2024-09-17 18:16:03,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:03,087 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:03,088 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:03,212 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-09-17 18:16:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-17 18:16:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:03,213 INFO L225 Difference]: With dead ends: 56 [2024-09-17 18:16:03,213 INFO L226 Difference]: Without dead ends: 54 [2024-09-17 18:16:03,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:16:03,214 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:03,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 46 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-17 18:16:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-09-17 18:16:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-09-17 18:16:03,226 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 21 [2024-09-17 18:16:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:03,226 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-09-17 18:16:03,226 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-09-17 18:16:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-17 18:16:03,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:03,227 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-17 18:16:03,227 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-17 18:16:03,227 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:03,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -682220907, now seen corresponding path program 1 times [2024-09-17 18:16:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902963567] [2024-09-17 18:16:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,324 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-17 18:16:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902963567] [2024-09-17 18:16:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902963567] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953720399] [2024-09-17 18:16:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:03,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:03,326 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:03,438 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-09-17 18:16:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-17 18:16:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:03,439 INFO L225 Difference]: With dead ends: 51 [2024-09-17 18:16:03,439 INFO L226 Difference]: Without dead ends: 49 [2024-09-17 18:16:03,440 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:16:03,440 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:03,440 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-17 18:16:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-09-17 18:16:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-09-17 18:16:03,450 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2024-09-17 18:16:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:03,451 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-09-17 18:16:03,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-09-17 18:16:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-17 18:16:03,452 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:03,452 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-17 18:16:03,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-17 18:16:03,452 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:03,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -634505657, now seen corresponding path program 1 times [2024-09-17 18:16:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443961182] [2024-09-17 18:16:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,557 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-17 18:16:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443961182] [2024-09-17 18:16:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443961182] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:16:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:16:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:16:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501388993] [2024-09-17 18:16:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:16:03,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:16:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:16:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:16:03,559 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:03,664 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-09-17 18:16:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:16:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-17 18:16:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:03,665 INFO L225 Difference]: With dead ends: 46 [2024-09-17 18:16:03,665 INFO L226 Difference]: Without dead ends: 23 [2024-09-17 18:16:03,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:16:03,666 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:03,666 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-17 18:16:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-17 18:16:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-09-17 18:16:03,672 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2024-09-17 18:16:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:03,672 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-09-17 18:16:03,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:16:03,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-09-17 18:16:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-17 18:16:03,673 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:16:03,674 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:16:03,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-17 18:16:03,674 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-17 18:16:03,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1822144134, now seen corresponding path program 1 times [2024-09-17 18:16:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:16:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353009562] [2024-09-17 18:16:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:16:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:16:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:16:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:16:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353009562] [2024-09-17 18:16:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353009562] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:16:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393260869] [2024-09-17 18:16:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:16:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:16:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:16:03,792 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-17 18:16:03,794 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-17 18:16:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:16:03,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-17 18:16:03,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:16:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:16:04,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:16:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-17 18:16:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393260869] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:16:04,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:16:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-17 18:16:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991368966] [2024-09-17 18:16:04,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:16:04,132 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-17 18:16:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:16:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-17 18:16:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-17 18:16:04,133 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 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-17 18:16:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:16:04,290 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-17 18:16:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-17 18:16:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 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 22 [2024-09-17 18:16:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:16:04,291 INFO L225 Difference]: With dead ends: 34 [2024-09-17 18:16:04,291 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 18:16:04,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-09-17 18:16:04,293 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:16:04,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:16:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 18:16:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 18:16:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-17 18:16:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 18:16:04,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-17 18:16:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:16:04,294 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 18:16:04,295 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 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-17 18:16:04,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:16:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 18:16:04,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 18:16:04,298 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2024-09-17 18:16:04,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2024-09-17 18:16:04,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2024-09-17 18:16:04,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2024-09-17 18:16:04,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2024-09-17 18:16:04,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2024-09-17 18:16:04,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2024-09-17 18:16:04,301 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2024-09-17 18:16:04,301 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2024-09-17 18:16:04,301 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2024-09-17 18:16:04,301 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2024-09-17 18:16:04,321 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-17 18:16:04,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-17 18:16:04,505 INFO L408 BasicCegarLoop]: Path program histogram: [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-17 18:16:04,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 18:16:06,193 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 18:16:06,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 06:16:06 BoogieIcfgContainer [2024-09-17 18:16:06,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 18:16:06,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-17 18:16:06,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-17 18:16:06,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-17 18:16:06,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:15:56" (3/4) ... [2024-09-17 18:16:06,217 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-17 18:16:06,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-17 18:16:06,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-17 18:16:06,275 INFO L158 Benchmark]: Toolchain (without parser) took 10891.07ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 129.4MB in the beginning and 160.6MB in the end (delta: -31.2MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,276 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:16:06,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.48ms. Allocated memory is still 163.6MB. Free memory was 129.4MB in the beginning and 110.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 163.6MB. Free memory was 110.5MB in the beginning and 109.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,276 INFO L158 Benchmark]: Boogie Preprocessor took 84.59ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,276 INFO L158 Benchmark]: RCFGBuilder took 561.11ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 123.9MB in the end (delta: -16.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,277 INFO L158 Benchmark]: TraceAbstraction took 9801.83ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 123.9MB in the beginning and 162.7MB in the end (delta: -38.8MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,277 INFO L158 Benchmark]: Witness Printer took 60.67ms. Allocated memory is still 285.2MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:16:06,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.48ms. Allocated memory is still 163.6MB. Free memory was 129.4MB in the beginning and 110.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 163.6MB. Free memory was 110.5MB in the beginning and 109.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.59ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.11ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 123.9MB in the end (delta: -16.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9801.83ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 123.9MB in the beginning and 162.7MB in the end (delta: -38.8MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Witness Printer took 60.67ms. Allocated memory is still 285.2MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 56]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 73]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 115]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 127]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 143]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 155]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 189]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 225]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 237]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 279]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 298]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 310]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 339]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 351]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 2244 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 698 mSDtfsCounter, 2988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 112 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1890 SizeOfPredicates, 6 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 64]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 283]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || ((main__t == 0) && (1 <= main__tagbuf_len))) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || (((main__tagbuf_len != main__t) && (main__t == 0)) && (main__t <= main__tagbuf_len))) - InvariantResult [Line: 102]: Location Invariant Derived location invariant: (((main__tagbuf_len != main__t) && (1 <= main__t)) && (main__t <= main__tagbuf_len)) RESULT: Ultimate proved your program to be correct! [2024-09-17 18:16:06,317 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE