./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/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 4d59f12bf134f1df229541fa7d7be9025273d18d299c01e889ca23a568445b7a --- 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:50:34,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:34,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:34,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:34,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:34,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:34,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:34,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:34,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:34,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:34,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:34,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:34,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:34,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:34,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:34,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:34,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:34,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:34,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:34,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:34,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:34,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:34,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:34,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:34,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:34,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:34,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:34,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:34,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:34,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:34,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:34,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:34,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:34,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:34,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:34,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:34,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:34,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:34,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:34,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:34,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:34,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:50:34,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:34,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:34,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:34,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:34,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:34,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:34,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:34,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:34,509 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:34,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:34,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:34,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:34,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:34,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:34,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:34,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:34,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:34,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:34,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:34,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:34,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:34,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:34,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:34,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:34,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:34,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:34,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:34,513 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:34,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:34,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:34,514 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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/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 -> 4d59f12bf134f1df229541fa7d7be9025273d18d299c01e889ca23a568445b7a [2022-11-02 20:50:34,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:34,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:34,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:34,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:34,843 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:34,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i [2022-11-02 20:50:34,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/data/cb1b4f20a/ea91b1d4f1a446c4acf8503b5a2c3755/FLAG3c2acf1ae [2022-11-02 20:50:35,771 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:35,772 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i [2022-11-02 20:50:35,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/data/cb1b4f20a/ea91b1d4f1a446c4acf8503b5a2c3755/FLAG3c2acf1ae [2022-11-02 20:50:36,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/data/cb1b4f20a/ea91b1d4f1a446c4acf8503b5a2c3755 [2022-11-02 20:50:36,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:36,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:36,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:36,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:36,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:36,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:36" (1/1) ... [2022-11-02 20:50:36,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e08c8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:36, skipping insertion in model container [2022-11-02 20:50:36,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:36" (1/1) ... [2022-11-02 20:50:36,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:36,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:38,050 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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i[216842,216855] [2022-11-02 20:50:38,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:38,147 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:38,542 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_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i[216842,216855] [2022-11-02 20:50:38,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:38,648 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:38,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38 WrapperNode [2022-11-02 20:50:38,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:38,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:38,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:38,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:38,659 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:50:38" (1/1) ... [2022-11-02 20:50:38,748 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:50:38" (1/1) ... [2022-11-02 20:50:38,884 INFO L138 Inliner]: procedures = 205, calls = 1417, calls flagged for inlining = 89, calls inlined = 83, statements flattened = 3287 [2022-11-02 20:50:38,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:38,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:38,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:38,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:38,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:38,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:38,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:38,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:39,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:39,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:50:38" (1/1) ... [2022-11-02 20:50:39,070 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:39,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:39,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:39,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:39,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:39,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:39,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:39,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:39,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-11-02 20:50:39,274 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-11-02 20:50:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure uas_zap_pending [2022-11-02 20:50:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_zap_pending [2022-11-02 20:50:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:50:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:50:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:50:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:50:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:50:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:50:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-11-02 20:50:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-11-02 20:50:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure uas_alloc_data_urb [2022-11-02 20:50:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_alloc_data_urb [2022-11-02 20:50:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-11-02 20:50:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-11-02 20:50:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:50:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:50:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-11-02 20:50:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-11-02 20:50:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-02 20:50:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-02 20:50:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:50:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:50:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure uas_add_work [2022-11-02 20:50:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_add_work [2022-11-02 20:50:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_scsi_host_template_3 [2022-11-02 20:50:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_scsi_host_template_3 [2022-11-02 20:50:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:50:39,280 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:50:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:50:39,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:50:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure uas_find_endpoints [2022-11-02 20:50:39,280 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_find_endpoints [2022-11-02 20:50:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:50:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:50:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure uas_log_cmd_state [2022-11-02 20:50:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_log_cmd_state [2022-11-02 20:50:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 20:50:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 20:50:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-11-02 20:50:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-11-02 20:50:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_urb [2022-11-02 20:50:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_urb [2022-11-02 20:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-11-02 20:50:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-11-02 20:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-11-02 20:50:39,284 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-11-02 20:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:50:39,284 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure uas_xfer_data [2022-11-02 20:50:39,284 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_xfer_data [2022-11-02 20:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-11-02 20:50:39,285 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-11-02 20:50:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wait_anchor_empty_timeout [2022-11-02 20:50:39,286 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wait_anchor_empty_timeout [2022-11-02 20:50:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:50:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure uas_try_complete [2022-11-02 20:50:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_try_complete [2022-11-02 20:50:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_report_bus_reset [2022-11-02 20:50:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_report_bus_reset [2022-11-02 20:50:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 20:50:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 20:50:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-11-02 20:50:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-11-02 20:50:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 20:50:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 20:50:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure uas_wait_for_pending_cmnds [2022-11-02 20:50:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_wait_for_pending_cmnds [2022-11-02 20:50:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-11-02 20:50:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-11-02 20:50:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-02 20:50:39,292 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-02 20:50:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:50:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure uas_data_cmplt [2022-11-02 20:50:39,292 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_data_cmplt [2022-11-02 20:50:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:50:39,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:50:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure __be16_to_cpup [2022-11-02 20:50:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __be16_to_cpup [2022-11-02 20:50:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:50:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure uas_shutdown [2022-11-02 20:50:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_shutdown [2022-11-02 20:50:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:50:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure uas_do_work [2022-11-02 20:50:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_do_work [2022-11-02 20:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 20:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 20:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-02 20:50:39,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-02 20:50:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure uas_disconnect [2022-11-02 20:50:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_disconnect [2022-11-02 20:50:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-11-02 20:50:39,298 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-11-02 20:50:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-11-02 20:50:39,298 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-11-02 20:50:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_pipe_endpoint [2022-11-02 20:50:39,298 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_pipe_endpoint [2022-11-02 20:50:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_out [2022-11-02 20:50:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_out [2022-11-02 20:50:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:50:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure uas_stat_cmplt [2022-11-02 20:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_stat_cmplt [2022-11-02 20:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:50:39,305 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_put [2022-11-02 20:50:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_put [2022-11-02 20:50:39,305 INFO L130 BoogieDeclarations]: Found specification of procedure uas_configure_endpoints [2022-11-02 20:50:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_configure_endpoints [2022-11-02 20:50:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-02 20:50:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-02 20:50:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure uas_free_unsubmitted_urbs [2022-11-02 20:50:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_free_unsubmitted_urbs [2022-11-02 20:50:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure uas_find_uas_alt_setting [2022-11-02 20:50:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_find_uas_alt_setting [2022-11-02 20:50:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-11-02 20:50:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-11-02 20:50:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_in [2022-11-02 20:50:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_in [2022-11-02 20:50:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:50:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:50:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure lock_is_held [2022-11-02 20:50:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_is_held [2022-11-02 20:50:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure uas_submit_urbs [2022-11-02 20:50:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_submit_urbs [2022-11-02 20:50:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure usb_reset_device [2022-11-02 20:50:39,318 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_reset_device [2022-11-02 20:50:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2022-11-02 20:50:39,318 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2022-11-02 20:50:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure uas_free_streams [2022-11-02 20:50:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure uas_free_streams [2022-11-02 20:50:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-11-02 20:50:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-11-02 20:50:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:40,000 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:40,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:40,393 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:50:43,456 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:43,477 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:43,478 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:50:43,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:43 BoogieIcfgContainer [2022-11-02 20:50:43,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:43,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:43,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:43,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:43,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:36" (1/3) ... [2022-11-02 20:50:43,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87102e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:43, skipping insertion in model container [2022-11-02 20:50:43,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38" (2/3) ... [2022-11-02 20:50:43,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87102e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:43, skipping insertion in model container [2022-11-02 20:50:43,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:43" (3/3) ... [2022-11-02 20:50:43,492 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--usb--storage--uas.ko-entry_point.cil.out.i [2022-11-02 20:50:43,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:43,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:50:43,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:43,596 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;@18c69308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:43,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:50:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 1052 states, 741 states have (on average 1.3454790823211875) internal successors, (997), 774 states have internal predecessors, (997), 243 states have call successors, (243), 67 states have call predecessors, (243), 66 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2022-11-02 20:50:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:50:43,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:43,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:50:43,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 395786387, now seen corresponding path program 1 times [2022-11-02 20:50:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:43,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246140666] [2022-11-02 20:50:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:50:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:50:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:50:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:50:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:50:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:50:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:44,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246140666] [2022-11-02 20:50:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246140666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:44,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796480475] [2022-11-02 20:50:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:44,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:44,626 INFO L87 Difference]: Start difference. First operand has 1052 states, 741 states have (on average 1.3454790823211875) internal successors, (997), 774 states have internal predecessors, (997), 243 states have call successors, (243), 67 states have call predecessors, (243), 66 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:49,200 INFO L93 Difference]: Finished difference Result 2450 states and 3620 transitions. [2022-11-02 20:50:49,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:49,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2022-11-02 20:50:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:49,235 INFO L225 Difference]: With dead ends: 2450 [2022-11-02 20:50:49,235 INFO L226 Difference]: Without dead ends: 1387 [2022-11-02 20:50:49,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:49,254 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 1841 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1363 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:49,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 2571 Invalid, 2992 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1363 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 20:50:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-11-02 20:50:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1036. [2022-11-02 20:50:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 732 states have (on average 1.3374316939890711) internal successors, (979), 758 states have internal predecessors, (979), 238 states have call successors, (238), 66 states have call predecessors, (238), 65 states have return successors, (237), 229 states have call predecessors, (237), 237 states have call successors, (237) [2022-11-02 20:50:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1454 transitions. [2022-11-02 20:50:49,468 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1454 transitions. Word has length 98 [2022-11-02 20:50:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:49,469 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 1454 transitions. [2022-11-02 20:50:49,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1454 transitions. [2022-11-02 20:50:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:50:49,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:49,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:50:49,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:49,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1846074270, now seen corresponding path program 1 times [2022-11-02 20:50:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460986032] [2022-11-02 20:50:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:50:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:50:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:50:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:50:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:50:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:50:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460986032] [2022-11-02 20:50:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460986032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:50,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:50,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:50:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598426135] [2022-11-02 20:50:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:50,126 INFO L87 Difference]: Start difference. First operand 1036 states and 1454 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,889 INFO L93 Difference]: Finished difference Result 3777 states and 5583 transitions. [2022-11-02 20:50:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:50:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-11-02 20:50:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:57,907 INFO L225 Difference]: With dead ends: 3777 [2022-11-02 20:50:57,908 INFO L226 Difference]: Without dead ends: 2754 [2022-11-02 20:50:57,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:50:57,914 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 5903 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 4043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6081 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 6786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4043 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:57,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6081 Valid, 3093 Invalid, 6786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4043 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-02 20:50:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2022-11-02 20:50:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2112. [2022-11-02 20:50:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1487 states have (on average 1.3375924680564897) internal successors, (1989), 1548 states have internal predecessors, (1989), 487 states have call successors, (487), 131 states have call predecessors, (487), 137 states have return successors, (530), 473 states have call predecessors, (530), 486 states have call successors, (530) [2022-11-02 20:50:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 3006 transitions. [2022-11-02 20:50:58,064 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 3006 transitions. Word has length 100 [2022-11-02 20:50:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:58,067 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 3006 transitions. [2022-11-02 20:50:58,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3006 transitions. [2022-11-02 20:50:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:50:58,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:58,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:50:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:58,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1251703727, now seen corresponding path program 1 times [2022-11-02 20:50:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933373877] [2022-11-02 20:50:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:50:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:50:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:50:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:50:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:50:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:50:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:58,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933373877] [2022-11-02 20:50:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933373877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:58,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:58,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:50:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386398163] [2022-11-02 20:50:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:58,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:58,827 INFO L87 Difference]: Start difference. First operand 2112 states and 3006 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:06,547 INFO L93 Difference]: Finished difference Result 6210 states and 9245 transitions. [2022-11-02 20:51:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2022-11-02 20:51:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:06,575 INFO L225 Difference]: With dead ends: 6210 [2022-11-02 20:51:06,575 INFO L226 Difference]: Without dead ends: 4111 [2022-11-02 20:51:06,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:06,586 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 5945 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 4036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6124 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4036 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:06,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6124 Valid, 3076 Invalid, 6749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4036 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-02 20:51:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2022-11-02 20:51:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 3183. [2022-11-02 20:51:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2239 states have (on average 1.3363108530594014) internal successors, (2992), 2335 states have internal predecessors, (2992), 734 states have call successors, (734), 196 states have call predecessors, (734), 209 states have return successors, (841), 715 states have call predecessors, (841), 733 states have call successors, (841) [2022-11-02 20:51:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4567 transitions. [2022-11-02 20:51:06,857 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4567 transitions. Word has length 99 [2022-11-02 20:51:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:06,857 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 4567 transitions. [2022-11-02 20:51:06,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4567 transitions. [2022-11-02 20:51:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:51:06,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:06,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:51:06,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:06,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash 228944921, now seen corresponding path program 1 times [2022-11-02 20:51:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:06,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571771684] [2022-11-02 20:51:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:51:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:51:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:51:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:51:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:51:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:51:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:07,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571771684] [2022-11-02 20:51:07,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571771684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:07,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:07,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284638567] [2022-11-02 20:51:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:07,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:07,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:07,479 INFO L87 Difference]: Start difference. First operand 3183 states and 4567 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:14,817 INFO L93 Difference]: Finished difference Result 8579 states and 12839 transitions. [2022-11-02 20:51:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2022-11-02 20:51:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:14,866 INFO L225 Difference]: With dead ends: 8579 [2022-11-02 20:51:14,866 INFO L226 Difference]: Without dead ends: 5409 [2022-11-02 20:51:14,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:14,883 INFO L413 NwaCegarLoop]: 1344 mSDtfsCounter, 5764 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 3941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5943 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 6615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3941 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:14,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5943 Valid, 3004 Invalid, 6615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3941 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 20:51:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2022-11-02 20:51:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 4238. [2022-11-02 20:51:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 2980 states have (on average 1.3355704697986577) internal successors, (3980), 3111 states have internal predecessors, (3980), 979 states have call successors, (979), 261 states have call predecessors, (979), 278 states have return successors, (1161), 950 states have call predecessors, (1161), 978 states have call successors, (1161) [2022-11-02 20:51:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 6120 transitions. [2022-11-02 20:51:15,215 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 6120 transitions. Word has length 98 [2022-11-02 20:51:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:15,216 INFO L495 AbstractCegarLoop]: Abstraction has 4238 states and 6120 transitions. [2022-11-02 20:51:15,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 6120 transitions. [2022-11-02 20:51:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:51:15,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:15,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:51:15,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:15,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 463493016, now seen corresponding path program 1 times [2022-11-02 20:51:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143859865] [2022-11-02 20:51:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:51:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:51:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:51:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:51:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:51:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:51:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:15,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143859865] [2022-11-02 20:51:15,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143859865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:15,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:15,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344548725] [2022-11-02 20:51:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:15,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:15,769 INFO L87 Difference]: Start difference. First operand 4238 states and 6120 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:24,202 INFO L93 Difference]: Finished difference Result 10954 states and 16567 transitions. [2022-11-02 20:51:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2022-11-02 20:51:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:24,247 INFO L225 Difference]: With dead ends: 10954 [2022-11-02 20:51:24,248 INFO L226 Difference]: Without dead ends: 6729 [2022-11-02 20:51:24,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:24,268 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 4941 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 3233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 6611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3233 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:24,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 3332 Invalid, 6611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3233 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-02 20:51:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2022-11-02 20:51:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 5287. [2022-11-02 20:51:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5287 states, 3719 states have (on average 1.3344985211078246) internal successors, (4963), 3883 states have internal predecessors, (4963), 1219 states have call successors, (1219), 326 states have call predecessors, (1219), 348 states have return successors, (1479), 1185 states have call predecessors, (1479), 1218 states have call successors, (1479) [2022-11-02 20:51:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 7661 transitions. [2022-11-02 20:51:24,692 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 7661 transitions. Word has length 101 [2022-11-02 20:51:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:24,694 INFO L495 AbstractCegarLoop]: Abstraction has 5287 states and 7661 transitions. [2022-11-02 20:51:24,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:51:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 7661 transitions. [2022-11-02 20:51:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:51:24,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:24,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:51:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:24,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1942040466, now seen corresponding path program 1 times [2022-11-02 20:51:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49508874] [2022-11-02 20:51:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:51:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:51:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:51:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:51:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:51:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:51:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:51:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-02 20:51:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49508874] [2022-11-02 20:51:25,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49508874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315065139] [2022-11-02 20:51:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:25,189 INFO L87 Difference]: Start difference. First operand 5287 states and 7661 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:51:27,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:51:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:36,250 INFO L93 Difference]: Finished difference Result 18093 states and 27164 transitions. [2022-11-02 20:51:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2022-11-02 20:51:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:36,335 INFO L225 Difference]: With dead ends: 18093 [2022-11-02 20:51:36,335 INFO L226 Difference]: Without dead ends: 12819 [2022-11-02 20:51:36,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:36,362 INFO L413 NwaCegarLoop]: 1792 mSDtfsCounter, 3383 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 2432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3541 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 6965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2432 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:36,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3541 Valid, 4529 Invalid, 6965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2432 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-11-02 20:51:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12819 states. [2022-11-02 20:51:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12819 to 10377. [2022-11-02 20:51:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 7297 states have (on average 1.3299986295737976) internal successors, (9705), 7623 states have internal predecessors, (9705), 2378 states have call successors, (2378), 636 states have call predecessors, (2378), 701 states have return successors, (3125), 2314 states have call predecessors, (3125), 2377 states have call successors, (3125) [2022-11-02 20:51:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15208 transitions. [2022-11-02 20:51:37,359 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15208 transitions. Word has length 118 [2022-11-02 20:51:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:37,360 INFO L495 AbstractCegarLoop]: Abstraction has 10377 states and 15208 transitions. [2022-11-02 20:51:37,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:51:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15208 transitions. [2022-11-02 20:51:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-02 20:51:37,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:37,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:37,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 532316594, now seen corresponding path program 1 times [2022-11-02 20:51:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:37,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509292235] [2022-11-02 20:51:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:51:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:51:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:51:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:51:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:51:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:51:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:51:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:51:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:51:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:51:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:51:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:51:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 20:51:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 20:51:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:51:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-02 20:51:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509292235] [2022-11-02 20:51:37,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509292235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:37,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:37,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985633316] [2022-11-02 20:51:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:37,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:37,912 INFO L87 Difference]: Start difference. First operand 10377 states and 15208 transitions. Second operand has 9 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:51:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:49,432 INFO L93 Difference]: Finished difference Result 35884 states and 55682 transitions. [2022-11-02 20:51:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:51:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 198 [2022-11-02 20:51:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:49,591 INFO L225 Difference]: With dead ends: 35884 [2022-11-02 20:51:49,591 INFO L226 Difference]: Without dead ends: 25520 [2022-11-02 20:51:49,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:51:49,644 INFO L413 NwaCegarLoop]: 1935 mSDtfsCounter, 4603 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 4030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4780 SdHoareTripleChecker+Valid, 3780 SdHoareTripleChecker+Invalid, 8822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4030 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:49,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4780 Valid, 3780 Invalid, 8822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4030 Valid, 4792 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-11-02 20:51:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25520 states. [2022-11-02 20:51:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25520 to 19990. [2022-11-02 20:51:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19990 states, 13885 states have (on average 1.3217861001080302) internal successors, (18353), 14551 states have internal predecessors, (18353), 4741 states have call successors, (4741), 1108 states have call predecessors, (4741), 1363 states have return successors, (7045), 4732 states have call predecessors, (7045), 4740 states have call successors, (7045) [2022-11-02 20:51:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19990 states to 19990 states and 30139 transitions. [2022-11-02 20:51:51,786 INFO L78 Accepts]: Start accepts. Automaton has 19990 states and 30139 transitions. Word has length 198 [2022-11-02 20:51:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:51,787 INFO L495 AbstractCegarLoop]: Abstraction has 19990 states and 30139 transitions. [2022-11-02 20:51:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:51:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19990 states and 30139 transitions. [2022-11-02 20:51:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-02 20:51:51,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:51,795 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:51,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -554351643, now seen corresponding path program 1 times [2022-11-02 20:51:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:51,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162068443] [2022-11-02 20:51:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:51:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:51:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:51:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:51:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:51:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:51:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:51:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:51:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:51:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:51:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:51:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:51:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:51:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-02 20:51:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 20:51:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 20:51:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-02 20:51:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162068443] [2022-11-02 20:51:52,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162068443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:52,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:52,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:52,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515476885] [2022-11-02 20:51:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:52,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:52,447 INFO L87 Difference]: Start difference. First operand 19990 states and 30139 transitions. Second operand has 9 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:02,123 INFO L93 Difference]: Finished difference Result 45483 states and 70589 transitions. [2022-11-02 20:52:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:52:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 227 [2022-11-02 20:52:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:02,402 INFO L225 Difference]: With dead ends: 45483 [2022-11-02 20:52:02,402 INFO L226 Difference]: Without dead ends: 25507 [2022-11-02 20:52:02,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:02,493 INFO L413 NwaCegarLoop]: 1220 mSDtfsCounter, 2928 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 2221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3023 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 6136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2221 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:02,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3023 Valid, 3015 Invalid, 6136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2221 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-02 20:52:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2022-11-02 20:52:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 19990. [2022-11-02 20:52:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19990 states, 13885 states have (on average 1.3210658984515664) internal successors, (18343), 14551 states have internal predecessors, (18343), 4741 states have call successors, (4741), 1108 states have call predecessors, (4741), 1363 states have return successors, (7045), 4732 states have call predecessors, (7045), 4740 states have call successors, (7045) [2022-11-02 20:52:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19990 states to 19990 states and 30129 transitions. [2022-11-02 20:52:04,663 INFO L78 Accepts]: Start accepts. Automaton has 19990 states and 30129 transitions. Word has length 227 [2022-11-02 20:52:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:04,664 INFO L495 AbstractCegarLoop]: Abstraction has 19990 states and 30129 transitions. [2022-11-02 20:52:04,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 19990 states and 30129 transitions. [2022-11-02 20:52:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-02 20:52:04,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:04,672 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:52:04,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash -398371101, now seen corresponding path program 1 times [2022-11-02 20:52:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610297679] [2022-11-02 20:52:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:52:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:52:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:52:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:52:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:52:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:52:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:52:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:52:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:52:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:52:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:52:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:52:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:52:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-02 20:52:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 20:52:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 20:52:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-02 20:52:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:05,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610297679] [2022-11-02 20:52:05,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610297679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:05,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:05,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29446054] [2022-11-02 20:52:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:05,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:05,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:05,624 INFO L87 Difference]: Start difference. First operand 19990 states and 30129 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:18,156 INFO L93 Difference]: Finished difference Result 50453 states and 80227 transitions. [2022-11-02 20:52:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:52:18,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 227 [2022-11-02 20:52:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:18,323 INFO L225 Difference]: With dead ends: 50453 [2022-11-02 20:52:18,323 INFO L226 Difference]: Without dead ends: 30487 [2022-11-02 20:52:18,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:18,402 INFO L413 NwaCegarLoop]: 1646 mSDtfsCounter, 4019 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 5601 mSolverCounterSat, 2795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 5126 SdHoareTripleChecker+Invalid, 8396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2795 IncrementalHoareTripleChecker+Valid, 5601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:18,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 5126 Invalid, 8396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2795 Valid, 5601 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-02 20:52:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30487 states. [2022-11-02 20:52:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30487 to 20010. [2022-11-02 20:52:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20010 states, 13905 states have (on average 1.320604099244876) internal successors, (18363), 14571 states have internal predecessors, (18363), 4741 states have call successors, (4741), 1108 states have call predecessors, (4741), 1363 states have return successors, (7045), 4732 states have call predecessors, (7045), 4740 states have call successors, (7045) [2022-11-02 20:52:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20010 states to 20010 states and 30149 transitions. [2022-11-02 20:52:21,330 INFO L78 Accepts]: Start accepts. Automaton has 20010 states and 30149 transitions. Word has length 227 [2022-11-02 20:52:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:21,331 INFO L495 AbstractCegarLoop]: Abstraction has 20010 states and 30149 transitions. [2022-11-02 20:52:21,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20010 states and 30149 transitions. [2022-11-02 20:52:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-11-02 20:52:21,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:21,339 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:52:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:52:21,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -632636068, now seen corresponding path program 1 times [2022-11-02 20:52:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287740946] [2022-11-02 20:52:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:52:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:52:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:52:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:52:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:52:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:52:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:52:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:52:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:52:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:52:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 20:52:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:52:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-02 20:52:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:52:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 20:52:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 20:52:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-02 20:52:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-02 20:52:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287740946] [2022-11-02 20:52:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287740946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:21,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:21,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054977473] [2022-11-02 20:52:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:21,942 INFO L87 Difference]: Start difference. First operand 20010 states and 30149 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,224 INFO L93 Difference]: Finished difference Result 54292 states and 83267 transitions. [2022-11-02 20:52:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:52:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 242 [2022-11-02 20:52:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,403 INFO L225 Difference]: With dead ends: 54292 [2022-11-02 20:52:32,403 INFO L226 Difference]: Without dead ends: 34306 [2022-11-02 20:52:32,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:52:32,488 INFO L413 NwaCegarLoop]: 2014 mSDtfsCounter, 3742 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 2763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3919 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 5671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2763 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3919 Valid, 3929 Invalid, 5671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2763 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-02 20:52:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34306 states. [2022-11-02 20:52:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34306 to 29171. [2022-11-02 20:52:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29171 states, 20271 states have (on average 1.3199151497212767) internal successors, (26756), 21244 states have internal predecessors, (26756), 6904 states have call successors, (6904), 1618 states have call predecessors, (6904), 1995 states have return successors, (10274), 6896 states have call predecessors, (10274), 6903 states have call successors, (10274) [2022-11-02 20:52:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29171 states to 29171 states and 43934 transitions. [2022-11-02 20:52:35,934 INFO L78 Accepts]: Start accepts. Automaton has 29171 states and 43934 transitions. Word has length 242 [2022-11-02 20:52:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:35,934 INFO L495 AbstractCegarLoop]: Abstraction has 29171 states and 43934 transitions. [2022-11-02 20:52:35,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:52:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 29171 states and 43934 transitions. [2022-11-02 20:52:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-11-02 20:52:35,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:35,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:52:35,954 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash 438532658, now seen corresponding path program 1 times [2022-11-02 20:52:35,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:35,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101950333] [2022-11-02 20:52:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:52:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:52:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:52:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:52:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:52:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:52:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:52:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 20:52:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 20:52:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 20:52:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:52:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 20:52:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-02 20:52:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-02 20:52:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-02 20:52:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-02 20:52:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-02 20:52:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-02 20:52:37,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:37,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101950333] [2022-11-02 20:52:37,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101950333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:37,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372643477] [2022-11-02 20:52:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:37,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:37,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:38,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 3596 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:52:38,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-02 20:52:38,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:38,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372643477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:38,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:38,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 11 [2022-11-02 20:52:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325710306] [2022-11-02 20:52:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:38,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:38,567 INFO L87 Difference]: Start difference. First operand 29171 states and 43934 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:52:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:41,502 INFO L93 Difference]: Finished difference Result 61993 states and 94087 transitions. [2022-11-02 20:52:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 245 [2022-11-02 20:52:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:41,641 INFO L225 Difference]: With dead ends: 61993 [2022-11-02 20:52:41,641 INFO L226 Difference]: Without dead ends: 32846 [2022-11-02 20:52:41,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:41,738 INFO L413 NwaCegarLoop]: 1756 mSDtfsCounter, 234 mSDsluCounter, 4998 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:41,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 6754 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32846 states. [2022-11-02 20:52:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32846 to 29211. [2022-11-02 20:52:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29211 states, 20301 states have (on average 1.3194423920003941) internal successors, (26786), 21274 states have internal predecessors, (26786), 6904 states have call successors, (6904), 1618 states have call predecessors, (6904), 2005 states have return successors, (10294), 6906 states have call predecessors, (10294), 6903 states have call successors, (10294) [2022-11-02 20:52:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29211 states to 29211 states and 43984 transitions. [2022-11-02 20:52:44,854 INFO L78 Accepts]: Start accepts. Automaton has 29211 states and 43984 transitions. Word has length 245 [2022-11-02 20:52:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:44,855 INFO L495 AbstractCegarLoop]: Abstraction has 29211 states and 43984 transitions. [2022-11-02 20:52:44,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:52:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 29211 states and 43984 transitions. [2022-11-02 20:52:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-11-02 20:52:44,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:44,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:52:45,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b26dae5-c61c-42c6-b9b7-be4ca17f4f99/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:52:45,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1133534905, now seen corresponding path program 1 times [2022-11-02 20:52:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26788956] [2022-11-02 20:52:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:52:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:52:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:52:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:52:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:52:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:52:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:52:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:52:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:52:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:52:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:52:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:52:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 20:52:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 20:52:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:52:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:52:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 20:52:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-02 20:52:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-02 20:52:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26788956] [2022-11-02 20:52:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26788956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:52:45,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011127442] [2022-11-02 20:52:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:52:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:52:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:45,979 INFO L87 Difference]: Start difference. First operand 29211 states and 43984 transitions. Second operand has 11 states, 10 states have (on average 14.6) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:52:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:58,292 INFO L93 Difference]: Finished difference Result 70075 states and 109811 transitions. [2022-11-02 20:52:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:58,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.6) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 252 [2022-11-02 20:52:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:58,461 INFO L225 Difference]: With dead ends: 70075 [2022-11-02 20:52:58,461 INFO L226 Difference]: Without dead ends: 40888 [2022-11-02 20:52:58,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:52:58,542 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 4228 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 5863 mSolverCounterSat, 3118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 5136 SdHoareTripleChecker+Invalid, 8981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3118 IncrementalHoareTripleChecker+Valid, 5863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:58,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 5136 Invalid, 8981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3118 Valid, 5863 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-02 20:52:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40888 states. [2022-11-02 20:53:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40888 to 29251. [2022-11-02 20:53:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29251 states, 20331 states have (on average 1.3189710294623973) internal successors, (26816), 21304 states have internal predecessors, (26816), 6904 states have call successors, (6904), 1618 states have call predecessors, (6904), 2015 states have return successors, (10314), 6916 states have call predecessors, (10314), 6903 states have call successors, (10314) [2022-11-02 20:53:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29251 states to 29251 states and 44034 transitions. [2022-11-02 20:53:01,548 INFO L78 Accepts]: Start accepts. Automaton has 29251 states and 44034 transitions. Word has length 252 [2022-11-02 20:53:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:01,548 INFO L495 AbstractCegarLoop]: Abstraction has 29251 states and 44034 transitions. [2022-11-02 20:53:01,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.6) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29251 states and 44034 transitions. [2022-11-02 20:53:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-02 20:53:01,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:01,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:01,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1945146469, now seen corresponding path program 1 times [2022-11-02 20:53:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:01,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677432147] [2022-11-02 20:53:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:53:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:53:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:53:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:53:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:53:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:53:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:53:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:53:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:53:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:53:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:53:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:53:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 20:53:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 20:53:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:53:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 20:53:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-02 20:53:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-02 20:53:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-02 20:53:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677432147] [2022-11-02 20:53:02,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677432147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:02,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:02,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:53:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994377955] [2022-11-02 20:53:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:02,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:53:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:53:02,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:02,165 INFO L87 Difference]: Start difference. First operand 29251 states and 44034 transitions. Second operand has 9 states, 8 states have (on average 18.75) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:13,428 INFO L93 Difference]: Finished difference Result 66480 states and 102981 transitions. [2022-11-02 20:53:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:53:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.75) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 257 [2022-11-02 20:53:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:13,596 INFO L225 Difference]: With dead ends: 66480 [2022-11-02 20:53:13,596 INFO L226 Difference]: Without dead ends: 37253 [2022-11-02 20:53:13,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:13,718 INFO L413 NwaCegarLoop]: 1210 mSDtfsCounter, 2692 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 2100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 6546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2100 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:13,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 3340 Invalid, 6546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2100 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-02 20:53:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37253 states. [2022-11-02 20:53:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37253 to 29271. [2022-11-02 20:53:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29271 states, 20351 states have (on average 1.31865755982507) internal successors, (26836), 21324 states have internal predecessors, (26836), 6904 states have call successors, (6904), 1618 states have call predecessors, (6904), 2015 states have return successors, (10314), 6916 states have call predecessors, (10314), 6903 states have call successors, (10314) [2022-11-02 20:53:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29271 states to 29271 states and 44054 transitions. [2022-11-02 20:53:16,850 INFO L78 Accepts]: Start accepts. Automaton has 29271 states and 44054 transitions. Word has length 257 [2022-11-02 20:53:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:16,850 INFO L495 AbstractCegarLoop]: Abstraction has 29271 states and 44054 transitions. [2022-11-02 20:53:16,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.75) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29271 states and 44054 transitions. [2022-11-02 20:53:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-11-02 20:53:16,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:16,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:53:16,859 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1177319590, now seen corresponding path program 1 times [2022-11-02 20:53:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530043305] [2022-11-02 20:53:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:53:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:53:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:53:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:53:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:53:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:53:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:53:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:53:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:53:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:53:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:53:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:53:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 20:53:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 20:53:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:53:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:53:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 20:53:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-02 20:53:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-02 20:53:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530043305] [2022-11-02 20:53:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530043305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:17,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:17,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494396724] [2022-11-02 20:53:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:17,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:53:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:53:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:17,592 INFO L87 Difference]: Start difference. First operand 29271 states and 44054 transitions. Second operand has 10 states, 9 states have (on average 16.22222222222222) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:28,398 INFO L93 Difference]: Finished difference Result 66620 states and 103141 transitions. [2022-11-02 20:53:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:53:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.22222222222222) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 252 [2022-11-02 20:53:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:28,613 INFO L225 Difference]: With dead ends: 66620 [2022-11-02 20:53:28,614 INFO L226 Difference]: Without dead ends: 37373 [2022-11-02 20:53:28,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:53:28,735 INFO L413 NwaCegarLoop]: 1206 mSDtfsCounter, 3483 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 4691 mSolverCounterSat, 2706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3578 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 7397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2706 IncrementalHoareTripleChecker+Valid, 4691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:28,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3578 Valid, 3107 Invalid, 7397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2706 Valid, 4691 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 20:53:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37373 states. [2022-11-02 20:53:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37373 to 29311. [2022-11-02 20:53:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29311 states, 20391 states have (on average 1.3180324653033202) internal successors, (26876), 21364 states have internal predecessors, (26876), 6904 states have call successors, (6904), 1618 states have call predecessors, (6904), 2015 states have return successors, (10314), 6916 states have call predecessors, (10314), 6903 states have call successors, (10314) [2022-11-02 20:53:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29311 states to 29311 states and 44094 transitions. [2022-11-02 20:53:31,620 INFO L78 Accepts]: Start accepts. Automaton has 29311 states and 44094 transitions. Word has length 252 [2022-11-02 20:53:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:31,621 INFO L495 AbstractCegarLoop]: Abstraction has 29311 states and 44094 transitions. [2022-11-02 20:53:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.22222222222222) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 29311 states and 44094 transitions. [2022-11-02 20:53:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-11-02 20:53:31,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:31,637 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:53:31,638 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1883916196, now seen corresponding path program 1 times [2022-11-02 20:53:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154963749] [2022-11-02 20:53:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:53:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:53:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:53:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:53:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:53:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:53:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:53:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:53:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:53:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:53:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:53:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:53:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 20:53:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 20:53:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:53:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:53:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 20:53:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-02 20:53:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-02 20:53:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:32,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154963749] [2022-11-02 20:53:32,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154963749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:32,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655672005] [2022-11-02 20:53:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:32,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:53:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:32,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:53:32,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:32,453 INFO L87 Difference]: Start difference. First operand 29311 states and 44094 transitions. Second operand has 10 states, 9 states have (on average 16.22222222222222) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:53:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:43,811 INFO L93 Difference]: Finished difference Result 66860 states and 103381 transitions. [2022-11-02 20:53:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:53:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.22222222222222) internal successors, (146), 4 states have internal predecessors, (146), 3 states have call successors, (25), 8 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 252 [2022-11-02 20:53:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:43,992 INFO L225 Difference]: With dead ends: 66860 [2022-11-02 20:53:43,993 INFO L226 Difference]: Without dead ends: 37573 [2022-11-02 20:53:44,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:53:44,110 INFO L413 NwaCegarLoop]: 1207 mSDtfsCounter, 3276 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 4912 mSolverCounterSat, 2507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3371 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 7419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2507 IncrementalHoareTripleChecker+Valid, 4912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:44,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3371 Valid, 3457 Invalid, 7419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2507 Valid, 4912 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-02 20:53:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37573 states.