./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:37,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:37,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:37,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:37,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:37,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:37,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:37,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:37,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:37,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:37,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:37,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:37,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:37,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:37,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:37,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:37,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:37,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:37,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:37,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:37,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:37,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:37,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:37,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:37,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:37,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:37,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:37,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:37,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:37,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:37,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:37,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:37,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:37,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:37,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:37,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:37,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:37,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:37,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:37,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:37,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:37,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:51:37,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:37,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:37,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:37,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:37,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:37,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:37,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:37,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:37,425 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:37,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:37,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:37,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:37,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:37,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:37,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:37,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:37,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:37,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:37,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:37,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:37,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:37,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:37,431 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:37,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:37,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:37,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e [2022-11-02 20:51:37,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:37,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:37,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:37,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:37,767 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:37,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-11-02 20:51:37,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/data/605c1a877/c874b695b71b476aad09ce99321f412a/FLAG6db47cca4 [2022-11-02 20:51:38,795 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:38,796 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-11-02 20:51:38,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/data/605c1a877/c874b695b71b476aad09ce99321f412a/FLAG6db47cca4 [2022-11-02 20:51:39,237 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/data/605c1a877/c874b695b71b476aad09ce99321f412a [2022-11-02 20:51:39,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:39,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:39,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:39,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:39,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:39,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:39" (1/1) ... [2022-11-02 20:51:39,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48fe6774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:39, skipping insertion in model container [2022-11-02 20:51:39,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:39" (1/1) ... [2022-11-02 20:51:39,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:39,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:40,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-11-02 20:51:41,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:41,073 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:41,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-11-02 20:51:41,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:41,624 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:41,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41 WrapperNode [2022-11-02 20:51:41,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:41,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:41,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:41,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:41,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:41,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:41,867 INFO L138 Inliner]: procedures = 174, calls = 1111, calls flagged for inlining = 78, calls inlined = 75, statements flattened = 3508 [2022-11-02 20:51:41,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:41,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:41,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:41,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:41,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:41,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:41,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:41,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,060 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:42,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:42,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:42,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:42,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (1/1) ... [2022-11-02 20:51:42,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:42,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:42,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2737935b-1789-4db8-9a61-23bee0c479e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure dlci_to_q922 [2022-11-02 20:51:42,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dlci_to_q922 [2022-11-02 20:51:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:51:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:51:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:51:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:51:42,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:51:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure dev_queue_xmit [2022-11-02 20:51:42,190 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_queue_xmit [2022-11-02 20:51:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-11-02 20:51:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-11-02 20:51:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure fr_hard_header [2022-11-02 20:51:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_hard_header [2022-11-02 20:51:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure find_pvc [2022-11-02 20:51:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure find_pvc [2022-11-02 20:51:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-02 20:51:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-02 20:51:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-11-02 20:51:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-11-02 20:51:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:51:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:51:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-02 20:51:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-02 20:51:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-11-02 20:51:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-11-02 20:51:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_carrier [2022-11-02 20:51:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_carrier [2022-11-02 20:51:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:51:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:51:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_2 [2022-11-02 20:51:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_2 [2022-11-02 20:51:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-11-02 20:51:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-11-02 20:51:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-02 20:51:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-02 20:51:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:51:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure fr_rx [2022-11-02 20:51:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_rx [2022-11-02 20:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_ioctl [2022-11-02 20:51:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_ioctl [2022-11-02 20:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-02 20:51:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-02 20:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:51:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:51:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure fr_ioctl [2022-11-02 20:51:42,199 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_ioctl [2022-11-02 20:51:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-11-02 20:51:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-11-02 20:51:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-11-02 20:51:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-11-02 20:51:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-11-02 20:51:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-11-02 20:51:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:51:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:51:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2022-11-02 20:51:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2022-11-02 20:51:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:51:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:51:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:51:42,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:51:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:51:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_change_mtu [2022-11-02 20:51:42,205 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_change_mtu [2022-11-02 20:51:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-11-02 20:51:42,206 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-11-02 20:51:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-11-02 20:51:42,206 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-11-02 20:51:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure fr_log_dlci_active [2022-11-02 20:51:42,207 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_log_dlci_active [2022-11-02 20:51:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:51:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure delete_unused_pvcs [2022-11-02 20:51:42,208 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_unused_pvcs [2022-11-02 20:51:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-02 20:51:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-02 20:51:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-11-02 20:51:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-11-02 20:51:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_is_used [2022-11-02 20:51:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_is_used [2022-11-02 20:51:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:51:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-02 20:51:42,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-02 20:51:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-02 20:51:42,210 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-02 20:51:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure fr_set_link_state [2022-11-02 20:51:42,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_set_link_state [2022-11-02 20:51:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure fr_lmi_send [2022-11-02 20:51:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_lmi_send [2022-11-02 20:51:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:51:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 20:51:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 20:51:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-11-02 20:51:42,214 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-11-02 20:51:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:51:42,215 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:51:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 20:51:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 20:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure get_dev_p [2022-11-02 20:51:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dev_p [2022-11-02 20:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-11-02 20:51:42,217 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-11-02 20:51:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure add_pvc [2022-11-02 20:51:42,217 INFO L138 BoogieDeclarations]: Found implementation of procedure add_pvc [2022-11-02 20:51:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice [2022-11-02 20:51:42,218 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice [2022-11-02 20:51:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:51:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:51:42,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:51:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-02 20:51:42,219 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-02 20:51:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:42,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:42,906 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:42,915 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:43,243 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:51:46,083 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:46,099 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:46,099 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:51:46,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:46 BoogieIcfgContainer [2022-11-02 20:51:46,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:46,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:46,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:46,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:46,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:39" (1/3) ... [2022-11-02 20:51:46,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41857fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:46, skipping insertion in model container [2022-11-02 20:51:46,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:41" (2/3) ... [2022-11-02 20:51:46,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41857fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:46, skipping insertion in model container [2022-11-02 20:51:46,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:46" (3/3) ... [2022-11-02 20:51:46,118 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-11-02 20:51:46,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:46,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:51:46,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:46,271 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@43c64e92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:46,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:51:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) [2022-11-02 20:51:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:51:46,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:46,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:46,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 16503480, now seen corresponding path program 1 times [2022-11-02 20:51:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:46,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252549001] [2022-11-02 20:51:46,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252549001] [2022-11-02 20:51:46,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252549001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:46,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:46,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22940248] [2022-11-02 20:51:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:47,005 INFO L87 Difference]: Start difference. First operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:52,170 INFO L93 Difference]: Finished difference Result 3724 states and 5603 transitions. [2022-11-02 20:51:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-02 20:51:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:52,214 INFO L225 Difference]: With dead ends: 3724 [2022-11-02 20:51:52,214 INFO L226 Difference]: Without dead ends: 2551 [2022-11-02 20:51:52,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:52,233 INFO L413 NwaCegarLoop]: 1884 mSDtfsCounter, 2215 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:52,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 3788 Invalid, 2244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [762 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 20:51:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2022-11-02 20:51:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2273. [2022-11-02 20:51:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-11-02 20:51:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3296 transitions. [2022-11-02 20:51:52,540 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3296 transitions. Word has length 41 [2022-11-02 20:51:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:52,541 INFO L495 AbstractCegarLoop]: Abstraction has 2273 states and 3296 transitions. [2022-11-02 20:51:52,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3296 transitions. [2022-11-02 20:51:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:51:52,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:52,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:52,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:52,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 202884705, now seen corresponding path program 1 times [2022-11-02 20:51:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:52,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109575459] [2022-11-02 20:51:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109575459] [2022-11-02 20:51:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109575459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:52,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:52,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003595715] [2022-11-02 20:51:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:52,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:51:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:51:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:52,745 INFO L87 Difference]: Start difference. First operand 2273 states and 3296 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:58,026 INFO L93 Difference]: Finished difference Result 4811 states and 7034 transitions. [2022-11-02 20:51:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-11-02 20:51:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:58,054 INFO L225 Difference]: With dead ends: 4811 [2022-11-02 20:51:58,054 INFO L226 Difference]: Without dead ends: 2550 [2022-11-02 20:51:58,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:58,076 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 2219 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 4228 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:58,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 4228 Invalid, 2141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [654 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 20:51:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-11-02 20:51:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2272. [2022-11-02 20:51:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-11-02 20:51:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3292 transitions. [2022-11-02 20:51:58,290 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3292 transitions. Word has length 44 [2022-11-02 20:51:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:58,291 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 3292 transitions. [2022-11-02 20:51:58,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3292 transitions. [2022-11-02 20:51:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:51:58,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:58,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:58,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:58,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -94841370, now seen corresponding path program 1 times [2022-11-02 20:51:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:58,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327732315] [2022-11-02 20:51:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-02 20:51:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:58,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327732315] [2022-11-02 20:51:58,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327732315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:58,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:58,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180158742] [2022-11-02 20:51:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:58,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:58,777 INFO L87 Difference]: Start difference. First operand 2272 states and 3292 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:52:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:05,347 INFO L93 Difference]: Finished difference Result 7337 states and 10822 transitions. [2022-11-02 20:52:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-11-02 20:52:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:05,380 INFO L225 Difference]: With dead ends: 7337 [2022-11-02 20:52:05,380 INFO L226 Difference]: Without dead ends: 5072 [2022-11-02 20:52:05,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:05,394 INFO L413 NwaCegarLoop]: 1877 mSDtfsCounter, 2202 mSDsluCounter, 4513 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 6390 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 3051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:05,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2422 Valid, 6390 Invalid, 3812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [761 Valid, 3051 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-02 20:52:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-11-02 20:52:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4554. [2022-11-02 20:52:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-11-02 20:52:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6648 transitions. [2022-11-02 20:52:05,684 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 6648 transitions. Word has length 66 [2022-11-02 20:52:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:05,688 INFO L495 AbstractCegarLoop]: Abstraction has 4554 states and 6648 transitions. [2022-11-02 20:52:05,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:52:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6648 transitions. [2022-11-02 20:52:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:52:05,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:05,701 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:05,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:52:05,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash -248182647, now seen corresponding path program 1 times [2022-11-02 20:52:05,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:05,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123947637] [2022-11-02 20:52:05,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:52:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:52:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:06,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123947637] [2022-11-02 20:52:06,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123947637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:06,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:06,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056800669] [2022-11-02 20:52:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:06,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:06,052 INFO L87 Difference]: Start difference. First operand 4554 states and 6648 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:52:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:15,580 INFO L93 Difference]: Finished difference Result 15534 states and 23138 transitions. [2022-11-02 20:52:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 103 [2022-11-02 20:52:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:15,653 INFO L225 Difference]: With dead ends: 15534 [2022-11-02 20:52:15,653 INFO L226 Difference]: Without dead ends: 10992 [2022-11-02 20:52:15,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:15,681 INFO L413 NwaCegarLoop]: 2704 mSDtfsCounter, 2575 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 3741 mSolverCounterSat, 1251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 5355 SdHoareTripleChecker+Invalid, 4992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1251 IncrementalHoareTripleChecker+Valid, 3741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:15,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2782 Valid, 5355 Invalid, 4992 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1251 Valid, 3741 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-02 20:52:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2022-11-02 20:52:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 9020. [2022-11-02 20:52:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 6596 states have (on average 1.3635536688902365) internal successors, (8994), 6698 states have internal predecessors, (8994), 2007 states have call successors, (2007), 389 states have call predecessors, (2007), 416 states have return successors, (2153), 2004 states have call predecessors, (2153), 2006 states have call successors, (2153) [2022-11-02 20:52:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 13154 transitions. [2022-11-02 20:52:16,516 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 13154 transitions. Word has length 103 [2022-11-02 20:52:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:16,517 INFO L495 AbstractCegarLoop]: Abstraction has 9020 states and 13154 transitions. [2022-11-02 20:52:16,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:52:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 13154 transitions. [2022-11-02 20:52:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:52:16,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:16,532 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:16,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:16,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1651725426, now seen corresponding path program 1 times [2022-11-02 20:52:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:16,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255367967] [2022-11-02 20:52:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:52:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:52:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:52:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-02 20:52:16,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:16,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255367967] [2022-11-02 20:52:16,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255367967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:16,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:16,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:16,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751992623] [2022-11-02 20:52:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:16,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:16,768 INFO L87 Difference]: Start difference. First operand 9020 states and 13154 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,888 INFO L93 Difference]: Finished difference Result 19708 states and 29148 transitions. [2022-11-02 20:52:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2022-11-02 20:52:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,956 INFO L225 Difference]: With dead ends: 19708 [2022-11-02 20:52:24,957 INFO L226 Difference]: Without dead ends: 10700 [2022-11-02 20:52:24,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:24,998 INFO L413 NwaCegarLoop]: 1850 mSDtfsCounter, 3137 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 1629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3341 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1629 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:24,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3341 Valid, 3859 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1629 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 20:52:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10700 states. [2022-11-02 20:52:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10700 to 8736. [2022-11-02 20:52:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8736 states, 6368 states have (on average 1.3613379396984924) internal successors, (8669), 6472 states have internal predecessors, (8669), 1957 states have call successors, (1957), 383 states have call predecessors, (1957), 410 states have return successors, (2098), 1952 states have call predecessors, (2098), 1956 states have call successors, (2098) [2022-11-02 20:52:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8736 states to 8736 states and 12724 transitions. [2022-11-02 20:52:25,714 INFO L78 Accepts]: Start accepts. Automaton has 8736 states and 12724 transitions. Word has length 95 [2022-11-02 20:52:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:25,715 INFO L495 AbstractCegarLoop]: Abstraction has 8736 states and 12724 transitions. [2022-11-02 20:52:25,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8736 states and 12724 transitions. [2022-11-02 20:52:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:52:25,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:25,730 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:52:25,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1725212051, now seen corresponding path program 1 times [2022-11-02 20:52:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:25,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314674000] [2022-11-02 20:52:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:52:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-02 20:52:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:25,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314674000] [2022-11-02 20:52:25,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314674000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:25,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:25,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608189661] [2022-11-02 20:52:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:25,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:25,970 INFO L87 Difference]: Start difference. First operand 8736 states and 12724 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:35,696 INFO L93 Difference]: Finished difference Result 19998 states and 29670 transitions. [2022-11-02 20:52:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2022-11-02 20:52:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:35,772 INFO L225 Difference]: With dead ends: 19998 [2022-11-02 20:52:35,772 INFO L226 Difference]: Without dead ends: 13371 [2022-11-02 20:52:35,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:35,802 INFO L413 NwaCegarLoop]: 2869 mSDtfsCounter, 2477 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 3861 mSolverCounterSat, 1208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 5708 SdHoareTripleChecker+Invalid, 5069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1208 IncrementalHoareTripleChecker+Valid, 3861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:35,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 5708 Invalid, 5069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1208 Valid, 3861 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-02 20:52:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2022-11-02 20:52:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 10917. [2022-11-02 20:52:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10917 states, 7963 states have (on average 1.361170413160869) internal successors, (10839), 8094 states have internal predecessors, (10839), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-11-02 20:52:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 15890 transitions. [2022-11-02 20:52:36,824 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 15890 transitions. Word has length 117 [2022-11-02 20:52:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:36,825 INFO L495 AbstractCegarLoop]: Abstraction has 10917 states and 15890 transitions. [2022-11-02 20:52:36,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 15890 transitions. [2022-11-02 20:52:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:52:36,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:36,844 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:36,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:52:36,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -159171181, now seen corresponding path program 1 times [2022-11-02 20:52:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:36,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599626418] [2022-11-02 20:52:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:52:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-02 20:52:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599626418] [2022-11-02 20:52:37,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599626418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:37,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:37,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185247774] [2022-11-02 20:52:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:37,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:37,097 INFO L87 Difference]: Start difference. First operand 10917 states and 15890 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,619 INFO L93 Difference]: Finished difference Result 27579 states and 40872 transitions. [2022-11-02 20:52:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:52:47,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2022-11-02 20:52:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,712 INFO L225 Difference]: With dead ends: 27579 [2022-11-02 20:52:47,713 INFO L226 Difference]: Without dead ends: 18771 [2022-11-02 20:52:47,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:47,754 INFO L413 NwaCegarLoop]: 2910 mSDtfsCounter, 2587 mSDsluCounter, 4673 mSDsCounter, 0 mSdLazyCounter, 5513 mSolverCounterSat, 1415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 7583 SdHoareTripleChecker+Invalid, 6928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1415 IncrementalHoareTripleChecker+Valid, 5513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 7583 Invalid, 6928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1415 Valid, 5513 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-02 20:52:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2022-11-02 20:52:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 10921. [2022-11-02 20:52:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10921 states, 7967 states have (on average 1.3609890799548137) internal successors, (10843), 8098 states have internal predecessors, (10843), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-11-02 20:52:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 15894 transitions. [2022-11-02 20:52:48,991 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 15894 transitions. Word has length 122 [2022-11-02 20:52:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:48,992 INFO L495 AbstractCegarLoop]: Abstraction has 10921 states and 15894 transitions. [2022-11-02 20:52:48,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:52:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 15894 transitions. [2022-11-02 20:52:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:52:49,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:49,017 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:49,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:52:49,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1619034978, now seen corresponding path program 1 times [2022-11-02 20:52:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:49,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701358745] [2022-11-02 20:52:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:52:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-11-02 20:52:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701358745] [2022-11-02 20:52:49,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701358745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:49,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:49,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032620300] [2022-11-02 20:52:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:49,279 INFO L87 Difference]: Start difference. First operand 10921 states and 15894 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:52:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:55,255 INFO L93 Difference]: Finished difference Result 19044 states and 28439 transitions. [2022-11-02 20:52:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:55,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 132 [2022-11-02 20:52:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:55,326 INFO L225 Difference]: With dead ends: 19044 [2022-11-02 20:52:55,326 INFO L226 Difference]: Without dead ends: 13373 [2022-11-02 20:52:55,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:55,357 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 1010 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:55,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 3569 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:52:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13373 states. [2022-11-02 20:52:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13373 to 10931. [2022-11-02 20:52:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10931 states, 7977 states have (on average 1.3605365425598597) internal successors, (10853), 8108 states have internal predecessors, (10853), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-11-02 20:52:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10931 states to 10931 states and 15904 transitions. [2022-11-02 20:52:56,421 INFO L78 Accepts]: Start accepts. Automaton has 10931 states and 15904 transitions. Word has length 132 [2022-11-02 20:52:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:56,422 INFO L495 AbstractCegarLoop]: Abstraction has 10931 states and 15904 transitions. [2022-11-02 20:52:56,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:52:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10931 states and 15904 transitions. [2022-11-02 20:52:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:52:56,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:56,441 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:52:56,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1510120385, now seen corresponding path program 1 times [2022-11-02 20:52:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:56,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077348189] [2022-11-02 20:52:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:52:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-11-02 20:52:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077348189] [2022-11-02 20:52:57,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077348189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:57,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:57,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375298955] [2022-11-02 20:52:57,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:57,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:57,075 INFO L87 Difference]: Start difference. First operand 10931 states and 15904 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:53:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:12,845 INFO L93 Difference]: Finished difference Result 27272 states and 40484 transitions. [2022-11-02 20:53:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:53:12,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 134 [2022-11-02 20:53:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:12,937 INFO L225 Difference]: With dead ends: 27272 [2022-11-02 20:53:12,938 INFO L226 Difference]: Without dead ends: 16353 [2022-11-02 20:53:12,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:53:12,988 INFO L413 NwaCegarLoop]: 1773 mSDtfsCounter, 5451 mSDsluCounter, 4990 mSDsCounter, 0 mSdLazyCounter, 9080 mSolverCounterSat, 3181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5748 SdHoareTripleChecker+Valid, 6763 SdHoareTripleChecker+Invalid, 12261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3181 IncrementalHoareTripleChecker+Valid, 9080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:12,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5748 Valid, 6763 Invalid, 12261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3181 Valid, 9080 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2022-11-02 20:53:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2022-11-02 20:53:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 12266. [2022-11-02 20:53:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 8957 states have (on average 1.353466562465111) internal successors, (12123), 9118 states have internal predecessors, (12123), 2688 states have call successors, (2688), 576 states have call predecessors, (2688), 620 states have return successors, (2913), 2681 states have call predecessors, (2913), 2687 states have call successors, (2913) [2022-11-02 20:53:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 17724 transitions. [2022-11-02 20:53:14,184 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 17724 transitions. Word has length 134 [2022-11-02 20:53:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:14,184 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 17724 transitions. [2022-11-02 20:53:14,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:53:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 17724 transitions. [2022-11-02 20:53:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-02 20:53:14,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:14,225 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:14,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:53:14,226 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1419893241, now seen corresponding path program 1 times [2022-11-02 20:53:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068996282] [2022-11-02 20:53:14,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:53:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:53:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:53:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:53:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:53:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:53:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:53:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:53:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:53:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 20:53:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-02 20:53:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:53:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:53:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-02 20:53:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-02 20:53:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-02 20:53:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-11-02 20:53:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068996282] [2022-11-02 20:53:14,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068996282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279652480] [2022-11-02 20:53:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:14,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:14,678 INFO L87 Difference]: Start difference. First operand 12266 states and 17724 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 20:53:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:19,361 INFO L93 Difference]: Finished difference Result 27785 states and 40884 transitions. [2022-11-02 20:53:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:53:19,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-11-02 20:53:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:19,447 INFO L225 Difference]: With dead ends: 27785 [2022-11-02 20:53:19,447 INFO L226 Difference]: Without dead ends: 15531 [2022-11-02 20:53:19,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:19,501 INFO L413 NwaCegarLoop]: 1642 mSDtfsCounter, 885 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:19,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 3506 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 20:53:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2022-11-02 20:53:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 13416. [2022-11-02 20:53:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13416 states, 9907 states have (on average 1.3498536388412234) internal successors, (13373), 10098 states have internal predecessors, (13373), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 620 states have return successors, (3158), 2891 states have call predecessors, (3158), 2887 states have call successors, (3158) [2022-11-02 20:53:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13416 states to 13416 states and 19419 transitions. [2022-11-02 20:53:20,584 INFO L78 Accepts]: Start accepts. Automaton has 13416 states and 19419 transitions. Word has length 208 [2022-11-02 20:53:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:20,585 INFO L495 AbstractCegarLoop]: Abstraction has 13416 states and 19419 transitions. [2022-11-02 20:53:20,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 20:53:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13416 states and 19419 transitions. [2022-11-02 20:53:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-02 20:53:20,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:20,612 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:20,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:53:20,613 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 277390775, now seen corresponding path program 1 times [2022-11-02 20:53:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:20,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577109623] [2022-11-02 20:53:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:53:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:53:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:53:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:53:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:53:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:53:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:53:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:53:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:53:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 20:53:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-02 20:53:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:53:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:53:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-02 20:53:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-02 20:53:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-02 20:53:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-11-02 20:53:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577109623] [2022-11-02 20:53:21,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577109623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:21,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345521444] [2022-11-02 20:53:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:21,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:21,493 INFO L87 Difference]: Start difference. First operand 13416 states and 19419 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 20:53:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:29,252 INFO L93 Difference]: Finished difference Result 28720 states and 42214 transitions. [2022-11-02 20:53:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:29,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-11-02 20:53:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:29,342 INFO L225 Difference]: With dead ends: 28720 [2022-11-02 20:53:29,343 INFO L226 Difference]: Without dead ends: 15316 [2022-11-02 20:53:29,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:29,407 INFO L413 NwaCegarLoop]: 1610 mSDtfsCounter, 424 mSDsluCounter, 4761 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 6371 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:29,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 6371 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 20:53:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15316 states. [2022-11-02 20:53:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15316 to 13456. [2022-11-02 20:53:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13456 states, 9937 states have (on average 1.3487974237697493) internal successors, (13403), 10128 states have internal predecessors, (13403), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 630 states have return successors, (3182), 2901 states have call predecessors, (3182), 2887 states have call successors, (3182) [2022-11-02 20:53:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13456 states to 13456 states and 19473 transitions. [2022-11-02 20:53:30,555 INFO L78 Accepts]: Start accepts. Automaton has 13456 states and 19473 transitions. Word has length 208 [2022-11-02 20:53:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:30,556 INFO L495 AbstractCegarLoop]: Abstraction has 13456 states and 19473 transitions. [2022-11-02 20:53:30,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 20:53:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 13456 states and 19473 transitions. [2022-11-02 20:53:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-02 20:53:30,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:30,588 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:30,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:30,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2029014981, now seen corresponding path program 1 times [2022-11-02 20:53:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:30,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590327873] [2022-11-02 20:53:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:30,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:53:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:53:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:53:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:53:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:53:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:53:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:53:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:53:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:53:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:53:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 20:53:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:53:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-02 20:53:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:53:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 20:53:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-02 20:53:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-11-02 20:53:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:34,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590327873] [2022-11-02 20:53:34,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590327873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:34,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:34,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:53:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011431544] [2022-11-02 20:53:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:34,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:53:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:53:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:34,236 INFO L87 Difference]: Start difference. First operand 13456 states and 19473 transitions. Second operand has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-02 20:53:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:47,758 INFO L93 Difference]: Finished difference Result 30395 states and 44714 transitions. [2022-11-02 20:53:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:53:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) Word has length 215 [2022-11-02 20:53:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:47,849 INFO L225 Difference]: With dead ends: 30395 [2022-11-02 20:53:47,849 INFO L226 Difference]: Without dead ends: 16951 [2022-11-02 20:53:47,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:53:47,902 INFO L413 NwaCegarLoop]: 1706 mSDtfsCounter, 504 mSDsluCounter, 15510 mSDsCounter, 0 mSdLazyCounter, 7997 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 17216 SdHoareTripleChecker+Invalid, 8296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 7997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:47,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 17216 Invalid, 8296 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [299 Valid, 7997 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-11-02 20:53:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16951 states. [2022-11-02 20:53:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16951 to 13536. [2022-11-02 20:53:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13536 states, 10007 states have (on average 1.3433596482462276) internal successors, (13443), 10188 states have internal predecessors, (13443), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 640 states have return successors, (3202), 2921 states have call predecessors, (3202), 2887 states have call successors, (3202) [2022-11-02 20:53:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 19533 transitions. [2022-11-02 20:53:49,043 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 19533 transitions. Word has length 215 [2022-11-02 20:53:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:49,044 INFO L495 AbstractCegarLoop]: Abstraction has 13536 states and 19533 transitions. [2022-11-02 20:53:49,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-02 20:53:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 19533 transitions. [2022-11-02 20:53:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-02 20:53:49,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:49,081 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:49,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:49,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1853804592, now seen corresponding path program 1 times [2022-11-02 20:53:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:49,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665651968] [2022-11-02 20:53:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:53:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:53:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:53:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:53:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:53:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:53:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:53:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:53:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:53:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:53:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:53:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:53:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:53:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:53:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:53:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:53:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:53:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:53:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:53:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:53:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-11-02 20:53:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665651968] [2022-11-02 20:53:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665651968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:49,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:49,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416989663] [2022-11-02 20:53:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:49,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:49,823 INFO L87 Difference]: Start difference. First operand 13536 states and 19533 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:02,884 INFO L93 Difference]: Finished difference Result 45858 states and 67578 transitions. [2022-11-02 20:54:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:54:02,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-11-02 20:54:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:03,041 INFO L225 Difference]: With dead ends: 45858 [2022-11-02 20:54:03,042 INFO L226 Difference]: Without dead ends: 32334 [2022-11-02 20:54:03,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:54:03,366 INFO L413 NwaCegarLoop]: 2244 mSDtfsCounter, 2275 mSDsluCounter, 5204 mSDsCounter, 0 mSdLazyCounter, 5143 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 7448 SdHoareTripleChecker+Invalid, 6058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 5143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:03,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 7448 Invalid, 6058 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [915 Valid, 5143 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-11-02 20:54:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32334 states. [2022-11-02 20:54:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32334 to 25796. [2022-11-02 20:54:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25796 states, 19254 states have (on average 1.3418510439389217) internal successors, (25836), 19600 states have internal predecessors, (25836), 5291 states have call successors, (5291), 1121 states have call predecessors, (5291), 1250 states have return successors, (5856), 5374 states have call predecessors, (5856), 5290 states have call successors, (5856) [2022-11-02 20:54:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25796 states to 25796 states and 36983 transitions. [2022-11-02 20:54:05,105 INFO L78 Accepts]: Start accepts. Automaton has 25796 states and 36983 transitions. Word has length 309 [2022-11-02 20:54:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:05,105 INFO L495 AbstractCegarLoop]: Abstraction has 25796 states and 36983 transitions. [2022-11-02 20:54:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25796 states and 36983 transitions. [2022-11-02 20:54:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-02 20:54:05,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:05,151 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:54:05,152 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 209812636, now seen corresponding path program 1 times [2022-11-02 20:54:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024390036] [2022-11-02 20:54:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:54:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:54:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:54:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:54:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:54:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:54:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:54:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:54:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:54:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:54:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:54:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:54:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:54:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:54:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:54:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:54:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:54:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:54:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:54:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:54:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-02 20:54:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:06,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024390036] [2022-11-02 20:54:06,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024390036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:06,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:06,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123857742] [2022-11-02 20:54:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:06,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:06,215 INFO L87 Difference]: Start difference. First operand 25796 states and 36983 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-11-02 20:54:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:15,016 INFO L93 Difference]: Finished difference Result 60524 states and 88845 transitions. [2022-11-02 20:54:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 309 [2022-11-02 20:54:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:15,167 INFO L225 Difference]: With dead ends: 60524 [2022-11-02 20:54:15,167 INFO L226 Difference]: Without dead ends: 34740 [2022-11-02 20:54:15,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:15,252 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 1198 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 725 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:15,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 4102 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [725 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:54:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34740 states. [2022-11-02 20:54:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34740 to 26996. [2022-11-02 20:54:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26996 states, 20254 states have (on average 1.3526217043546953) internal successors, (27396), 20620 states have internal predecessors, (27396), 5491 states have call successors, (5491), 1121 states have call predecessors, (5491), 1250 states have return successors, (6056), 5574 states have call predecessors, (6056), 5490 states have call successors, (6056) [2022-11-02 20:54:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26996 states to 26996 states and 38943 transitions. [2022-11-02 20:54:17,247 INFO L78 Accepts]: Start accepts. Automaton has 26996 states and 38943 transitions. Word has length 309 [2022-11-02 20:54:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:17,248 INFO L495 AbstractCegarLoop]: Abstraction has 26996 states and 38943 transitions. [2022-11-02 20:54:17,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-11-02 20:54:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26996 states and 38943 transitions. [2022-11-02 20:54:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-02 20:54:17,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:17,305 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:17,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:54:17,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -429672610, now seen corresponding path program 1 times [2022-11-02 20:54:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601476501] [2022-11-02 20:54:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:54:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:54:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:54:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:54:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:54:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:54:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:54:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:54:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:54:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:54:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:54:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:54:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:54:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:54:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:54:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:54:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:54:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:54:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:54:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:54:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-02 20:54:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:18,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601476501] [2022-11-02 20:54:18,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601476501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:18,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:18,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:18,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088146182] [2022-11-02 20:54:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:18,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:18,402 INFO L87 Difference]: Start difference. First operand 26996 states and 38943 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:27,485 INFO L93 Difference]: Finished difference Result 61744 states and 90795 transitions. [2022-11-02 20:54:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:27,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-11-02 20:54:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:27,609 INFO L225 Difference]: With dead ends: 61744 [2022-11-02 20:54:27,609 INFO L226 Difference]: Without dead ends: 34760 [2022-11-02 20:54:27,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:27,679 INFO L413 NwaCegarLoop]: 1561 mSDtfsCounter, 714 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 4427 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:27,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 4427 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 20:54:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34760 states. [2022-11-02 20:54:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34760 to 27596. [2022-11-02 20:54:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3588535154371453) internal successors, (28256), 21160 states have internal predecessors, (28256), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-11-02 20:54:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39923 transitions. [2022-11-02 20:54:29,715 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39923 transitions. Word has length 309 [2022-11-02 20:54:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:29,716 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39923 transitions. [2022-11-02 20:54:29,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39923 transitions. [2022-11-02 20:54:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-02 20:54:29,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:29,776 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:29,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:54:29,776 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -145687072, now seen corresponding path program 1 times [2022-11-02 20:54:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:29,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794507352] [2022-11-02 20:54:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:54:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:54:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:54:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:54:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:54:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:54:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:54:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:54:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:54:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:54:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:54:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:54:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:54:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:54:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:54:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:54:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:54:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:54:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:54:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:54:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:54:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-02 20:54:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:30,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794507352] [2022-11-02 20:54:30,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794507352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:30,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:30,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935229934] [2022-11-02 20:54:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:30,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:30,647 INFO L87 Difference]: Start difference. First operand 27596 states and 39923 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:38,875 INFO L93 Difference]: Finished difference Result 62004 states and 91175 transitions. [2022-11-02 20:54:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-11-02 20:54:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:38,979 INFO L225 Difference]: With dead ends: 62004 [2022-11-02 20:54:38,980 INFO L226 Difference]: Without dead ends: 34420 [2022-11-02 20:54:39,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:39,035 INFO L413 NwaCegarLoop]: 1584 mSDtfsCounter, 1093 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:39,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3923 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 20:54:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34420 states. [2022-11-02 20:54:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34420 to 27596. [2022-11-02 20:54:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3550062518034047) internal successors, (28176), 21160 states have internal predecessors, (28176), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-11-02 20:54:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39843 transitions. [2022-11-02 20:54:41,261 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39843 transitions. Word has length 309 [2022-11-02 20:54:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:41,262 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39843 transitions. [2022-11-02 20:54:41,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-02 20:54:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39843 transitions. [2022-11-02 20:54:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-11-02 20:54:41,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:41,317 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:41,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:54:41,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1138629090, now seen corresponding path program 1 times [2022-11-02 20:54:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:41,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516270678] [2022-11-02 20:54:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:54:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:54:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:54:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:54:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:54:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:54:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:54:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:54:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:54:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:54:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:54:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:54:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:54:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:54:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:54:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:54:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:54:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:54:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:54:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:54:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:54:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-02 20:54:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-02 20:54:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-11-02 20:54:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:42,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516270678] [2022-11-02 20:54:42,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516270678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:42,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:42,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962277542] [2022-11-02 20:54:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:42,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:42,325 INFO L87 Difference]: Start difference. First operand 27596 states and 39843 transitions. Second operand has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-02 20:54:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:54,441 INFO L93 Difference]: Finished difference Result 62559 states and 91271 transitions. [2022-11-02 20:54:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:54:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 314 [2022-11-02 20:54:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:54,550 INFO L225 Difference]: With dead ends: 62559 [2022-11-02 20:54:54,550 INFO L226 Difference]: Without dead ends: 34975 [2022-11-02 20:54:54,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:54:54,609 INFO L413 NwaCegarLoop]: 1918 mSDtfsCounter, 2188 mSDsluCounter, 5299 mSDsCounter, 0 mSdLazyCounter, 4283 mSolverCounterSat, 1385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 7217 SdHoareTripleChecker+Invalid, 5668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1385 IncrementalHoareTripleChecker+Valid, 4283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:54,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 7217 Invalid, 5668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1385 Valid, 4283 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-02 20:54:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34975 states. [2022-11-02 20:54:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34975 to 29188. [2022-11-02 20:54:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29188 states, 21983 states have (on average 1.3436291679934496) internal successors, (29537), 22387 states have internal predecessors, (29537), 5795 states have call successors, (5795), 1251 states have call predecessors, (5795), 1409 states have return successors, (6448), 5915 states have call predecessors, (6448), 5794 states have call successors, (6448) [2022-11-02 20:54:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29188 states to 29188 states and 41780 transitions. [2022-11-02 20:54:56,765 INFO L78 Accepts]: Start accepts. Automaton has 29188 states and 41780 transitions. Word has length 314 [2022-11-02 20:54:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:56,766 INFO L495 AbstractCegarLoop]: Abstraction has 29188 states and 41780 transitions. [2022-11-02 20:54:56,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-02 20:54:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29188 states and 41780 transitions. [2022-11-02 20:54:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-11-02 20:54:56,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:56,814 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:56,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:54:56,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash -733109948, now seen corresponding path program 1 times [2022-11-02 20:54:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:56,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912653390] [2022-11-02 20:54:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:56,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms