./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- 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-e04fb08 [2022-11-16 12:50:37,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:50:37,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:50:37,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:50:37,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:50:37,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:50:37,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:50:37,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:50:37,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:50:37,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:50:37,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:50:37,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:50:37,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:50:37,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:50:37,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:50:37,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:50:37,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:50:37,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:50:37,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:50:37,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:50:37,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:50:37,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:50:37,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:50:37,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:50:37,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:50:37,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:50:37,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:50:37,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:50:37,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:50:37,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:50:37,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:50:37,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:50:37,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:50:37,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:50:37,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:50:37,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:50:37,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:50:37,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:50:37,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:50:37,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:50:37,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:50:37,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:50:37,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:50:37,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:50:37,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:50:37,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:50:37,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:50:37,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:50:37,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:50:37,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:50:37,666 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:50:37,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:50:37,667 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:50:37,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:50:37,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:50:37,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:50:37,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:50:37,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:37,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:50:37,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:50:37,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:50:37,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:50:37,670 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_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/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_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2022-11-16 12:50:37,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:50:37,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:50:37,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:50:37,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:50:37,981 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:50:37,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-16 12:50:38,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/data/ce9070f5a/a48b93ea5d6a4498b6c1438fc5d50009/FLAGe601499dc [2022-11-16 12:50:38,612 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:50:38,613 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-16 12:50:38,635 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/data/ce9070f5a/a48b93ea5d6a4498b6c1438fc5d50009/FLAGe601499dc [2022-11-16 12:50:38,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/data/ce9070f5a/a48b93ea5d6a4498b6c1438fc5d50009 [2022-11-16 12:50:38,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:50:38,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:50:38,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:38,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:50:38,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:50:38,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:38" (1/1) ... [2022-11-16 12:50:38,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3439b7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:38, skipping insertion in model container [2022-11-16 12:50:38,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:38" (1/1) ... [2022-11-16 12:50:38,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:50:38,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:50:39,435 WARN L229 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_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-16 12:50:39,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:39,459 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:50:39,513 WARN L229 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_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-16 12:50:39,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:39,555 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:50:39,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39 WrapperNode [2022-11-16 12:50:39,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:39,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:39,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:50:39,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:50:39,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,619 INFO L138 Inliner]: procedures = 184, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2022-11-16 12:50:39,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:39,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:50:39,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:50:39,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:50:39,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,663 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:50:39,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:50:39,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:50:39,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:50:39,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (1/1) ... [2022-11-16 12:50:39,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:39,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:50:39,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:50:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:50:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 12:50:39,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 12:50:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-11-16 12:50:39,782 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-11-16 12:50:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:50:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:50:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-11-16 12:50:39,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-11-16 12:50:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:50:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:50:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:50:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-11-16 12:50:39,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-11-16 12:50:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2022-11-16 12:50:39,785 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2022-11-16 12:50:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-11-16 12:50:39,786 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-11-16 12:50:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:50:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-11-16 12:50:39,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-11-16 12:50:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:50:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-11-16 12:50:39,787 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-11-16 12:50:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:50:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-11-16 12:50:39,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-11-16 12:50:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-16 12:50:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:50:39,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:50:40,007 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:50:40,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:50:41,089 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:50:41,115 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:50:41,115 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:50:41,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:41 BoogieIcfgContainer [2022-11-16 12:50:41,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:50:41,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:50:41,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:50:41,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:50:41,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:50:38" (1/3) ... [2022-11-16 12:50:41,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524959f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:41, skipping insertion in model container [2022-11-16 12:50:41,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:39" (2/3) ... [2022-11-16 12:50:41,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524959f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:41, skipping insertion in model container [2022-11-16 12:50:41,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:41" (3/3) ... [2022-11-16 12:50:41,133 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2022-11-16 12:50:41,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:50:41,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2022-11-16 12:50:41,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:41,220 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37e8c425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:41,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2022-11-16 12:50:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 200 states have (on average 1.95) internal successors, (390), 362 states have internal predecessors, (390), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-16 12:50:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:50:41,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:41,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:41,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1250997951, now seen corresponding path program 1 times [2022-11-16 12:50:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:41,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281394017] [2022-11-16 12:50:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:41,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281394017] [2022-11-16 12:50:41,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281394017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:41,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:41,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:41,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459236294] [2022-11-16 12:50:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:41,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:41,755 INFO L87 Difference]: Start difference. First operand has 401 states, 200 states have (on average 1.95) internal successors, (390), 362 states have internal predecessors, (390), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:42,633 INFO L93 Difference]: Finished difference Result 466 states and 557 transitions. [2022-11-16 12:50:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:50:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-16 12:50:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:42,663 INFO L225 Difference]: With dead ends: 466 [2022-11-16 12:50:42,663 INFO L226 Difference]: Without dead ends: 464 [2022-11-16 12:50:42,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:42,670 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 577 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:42,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 426 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:50:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-16 12:50:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 395. [2022-11-16 12:50:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 213 states have (on average 1.8169014084507042) internal successors, (387), 351 states have internal predecessors, (387), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 456 transitions. [2022-11-16 12:50:42,771 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 456 transitions. Word has length 7 [2022-11-16 12:50:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:42,771 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 456 transitions. [2022-11-16 12:50:42,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 456 transitions. [2022-11-16 12:50:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:50:42,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:42,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:42,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:50:42,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1250997952, now seen corresponding path program 1 times [2022-11-16 12:50:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:42,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071271056] [2022-11-16 12:50:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071271056] [2022-11-16 12:50:42,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071271056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:42,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:42,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123409575] [2022-11-16 12:50:42,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:42,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:42,964 INFO L87 Difference]: Start difference. First operand 395 states and 456 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:43,629 INFO L93 Difference]: Finished difference Result 432 states and 516 transitions. [2022-11-16 12:50:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:50:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-16 12:50:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:43,641 INFO L225 Difference]: With dead ends: 432 [2022-11-16 12:50:43,642 INFO L226 Difference]: Without dead ends: 432 [2022-11-16 12:50:43,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:43,644 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 160 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:43,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1017 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:50:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-16 12:50:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 392. [2022-11-16 12:50:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 215 states have (on average 1.7813953488372094) internal successors, (383), 347 states have internal predecessors, (383), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 452 transitions. [2022-11-16 12:50:43,693 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 452 transitions. Word has length 7 [2022-11-16 12:50:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:43,694 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 452 transitions. [2022-11-16 12:50:43,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 452 transitions. [2022-11-16 12:50:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:50:43,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:43,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:43,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:50:43,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1049181770, now seen corresponding path program 1 times [2022-11-16 12:50:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:43,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483231276] [2022-11-16 12:50:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:43,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483231276] [2022-11-16 12:50:43,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483231276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:43,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22896571] [2022-11-16 12:50:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:43,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:43,987 INFO L87 Difference]: Start difference. First operand 392 states and 452 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:44,710 INFO L93 Difference]: Finished difference Result 431 states and 515 transitions. [2022-11-16 12:50:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-16 12:50:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:44,714 INFO L225 Difference]: With dead ends: 431 [2022-11-16 12:50:44,714 INFO L226 Difference]: Without dead ends: 431 [2022-11-16 12:50:44,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:50:44,715 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 164 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:44,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1269 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:50:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-16 12:50:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 391. [2022-11-16 12:50:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 215 states have (on average 1.7767441860465116) internal successors, (382), 346 states have internal predecessors, (382), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 451 transitions. [2022-11-16 12:50:44,734 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 451 transitions. Word has length 10 [2022-11-16 12:50:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:44,735 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 451 transitions. [2022-11-16 12:50:44,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 451 transitions. [2022-11-16 12:50:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:50:44,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:44,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:44,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:50:44,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1049181771, now seen corresponding path program 1 times [2022-11-16 12:50:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:44,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689143152] [2022-11-16 12:50:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:45,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689143152] [2022-11-16 12:50:45,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689143152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:45,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:45,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826697862] [2022-11-16 12:50:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:45,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:45,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:45,051 INFO L87 Difference]: Start difference. First operand 391 states and 451 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:45,898 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2022-11-16 12:50:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-16 12:50:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:45,901 INFO L225 Difference]: With dead ends: 430 [2022-11-16 12:50:45,901 INFO L226 Difference]: Without dead ends: 430 [2022-11-16 12:50:45,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:50:45,903 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 158 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:45,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1258 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:50:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-16 12:50:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 390. [2022-11-16 12:50:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 215 states have (on average 1.7720930232558139) internal successors, (381), 345 states have internal predecessors, (381), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 450 transitions. [2022-11-16 12:50:45,922 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 450 transitions. Word has length 10 [2022-11-16 12:50:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:45,922 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 450 transitions. [2022-11-16 12:50:45,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 450 transitions. [2022-11-16 12:50:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:50:45,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:45,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:50:45,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1322669809, now seen corresponding path program 1 times [2022-11-16 12:50:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:45,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817463787] [2022-11-16 12:50:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817463787] [2022-11-16 12:50:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817463787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:46,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34578183] [2022-11-16 12:50:46,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:46,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:46,084 INFO L87 Difference]: Start difference. First operand 390 states and 450 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:46,478 INFO L93 Difference]: Finished difference Result 429 states and 513 transitions. [2022-11-16 12:50:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:50:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-16 12:50:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:46,481 INFO L225 Difference]: With dead ends: 429 [2022-11-16 12:50:46,482 INFO L226 Difference]: Without dead ends: 429 [2022-11-16 12:50:46,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:46,486 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 150 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:46,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 805 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-16 12:50:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 389. [2022-11-16 12:50:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 215 states have (on average 1.7674418604651163) internal successors, (380), 344 states have internal predecessors, (380), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 449 transitions. [2022-11-16 12:50:46,517 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 449 transitions. Word has length 16 [2022-11-16 12:50:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:46,517 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 449 transitions. [2022-11-16 12:50:46,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 449 transitions. [2022-11-16 12:50:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:50:46,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:46,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:46,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:50:46,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1322669808, now seen corresponding path program 1 times [2022-11-16 12:50:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:46,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44028927] [2022-11-16 12:50:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44028927] [2022-11-16 12:50:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44028927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:46,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5547499] [2022-11-16 12:50:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:46,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:46,663 INFO L87 Difference]: Start difference. First operand 389 states and 449 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:47,121 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2022-11-16 12:50:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:50:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-16 12:50:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:47,124 INFO L225 Difference]: With dead ends: 428 [2022-11-16 12:50:47,124 INFO L226 Difference]: Without dead ends: 428 [2022-11-16 12:50:47,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:47,126 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 149 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:47,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 792 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-16 12:50:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 388. [2022-11-16 12:50:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 215 states have (on average 1.7627906976744185) internal successors, (379), 343 states have internal predecessors, (379), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 448 transitions. [2022-11-16 12:50:47,147 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 448 transitions. Word has length 16 [2022-11-16 12:50:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:47,148 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 448 transitions. [2022-11-16 12:50:47,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 448 transitions. [2022-11-16 12:50:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:50:47,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:47,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:47,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:50:47,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1625786511, now seen corresponding path program 1 times [2022-11-16 12:50:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657774528] [2022-11-16 12:50:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657774528] [2022-11-16 12:50:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657774528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:47,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:47,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896667628] [2022-11-16 12:50:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:47,421 INFO L87 Difference]: Start difference. First operand 388 states and 448 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:48,412 INFO L93 Difference]: Finished difference Result 436 states and 525 transitions. [2022-11-16 12:50:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-16 12:50:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:48,415 INFO L225 Difference]: With dead ends: 436 [2022-11-16 12:50:48,415 INFO L226 Difference]: Without dead ends: 436 [2022-11-16 12:50:48,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:48,416 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 621 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:48,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 458 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-16 12:50:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 369. [2022-11-16 12:50:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 215 states have (on average 1.6651162790697673) internal successors, (358), 324 states have internal predecessors, (358), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-16 12:50:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 427 transitions. [2022-11-16 12:50:48,430 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 427 transitions. Word has length 19 [2022-11-16 12:50:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:48,431 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 427 transitions. [2022-11-16 12:50:48,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-11-16 12:50:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:50:48,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:48,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:48,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:50:48,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -373735986, now seen corresponding path program 1 times [2022-11-16 12:50:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:48,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572995831] [2022-11-16 12:50:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572995831] [2022-11-16 12:50:48,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572995831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:48,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:48,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286382497] [2022-11-16 12:50:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:48,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:48,694 INFO L87 Difference]: Start difference. First operand 369 states and 427 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:49,691 INFO L93 Difference]: Finished difference Result 442 states and 542 transitions. [2022-11-16 12:50:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:50:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-16 12:50:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:49,694 INFO L225 Difference]: With dead ends: 442 [2022-11-16 12:50:49,694 INFO L226 Difference]: Without dead ends: 442 [2022-11-16 12:50:49,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:50:49,696 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 227 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:49,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1617 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-16 12:50:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 392. [2022-11-16 12:50:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 344 states have internal predecessors, (385), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (41), 33 states have call predecessors, (41), 33 states have call successors, (41) [2022-11-16 12:50:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 459 transitions. [2022-11-16 12:50:49,712 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 459 transitions. Word has length 25 [2022-11-16 12:50:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:49,713 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 459 transitions. [2022-11-16 12:50:49,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 459 transitions. [2022-11-16 12:50:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:50:49,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:49,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:49,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:50:49,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash -373735985, now seen corresponding path program 1 times [2022-11-16 12:50:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126115302] [2022-11-16 12:50:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:49,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126115302] [2022-11-16 12:50:49,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126115302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:49,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:50,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338041066] [2022-11-16 12:50:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:50,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:50,002 INFO L87 Difference]: Start difference. First operand 392 states and 459 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:51,036 INFO L93 Difference]: Finished difference Result 441 states and 541 transitions. [2022-11-16 12:50:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:50:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-16 12:50:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:51,040 INFO L225 Difference]: With dead ends: 441 [2022-11-16 12:50:51,045 INFO L226 Difference]: Without dead ends: 441 [2022-11-16 12:50:51,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:50:51,046 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 218 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:51,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1657 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-16 12:50:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 392. [2022-11-16 12:50:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 234 states have (on average 1.641025641025641) internal successors, (384), 344 states have internal predecessors, (384), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (41), 33 states have call predecessors, (41), 33 states have call successors, (41) [2022-11-16 12:50:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 458 transitions. [2022-11-16 12:50:51,072 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 458 transitions. Word has length 25 [2022-11-16 12:50:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:51,074 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 458 transitions. [2022-11-16 12:50:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 458 transitions. [2022-11-16 12:50:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:50:51,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:51,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:51,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:50:51,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1288018163, now seen corresponding path program 1 times [2022-11-16 12:50:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866825057] [2022-11-16 12:50:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:51,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866825057] [2022-11-16 12:50:51,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866825057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:51,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:51,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217189980] [2022-11-16 12:50:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:51,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:51,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:51,262 INFO L87 Difference]: Start difference. First operand 392 states and 458 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:52,301 INFO L93 Difference]: Finished difference Result 525 states and 653 transitions. [2022-11-16 12:50:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:50:52,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-16 12:50:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:52,305 INFO L225 Difference]: With dead ends: 525 [2022-11-16 12:50:52,305 INFO L226 Difference]: Without dead ends: 525 [2022-11-16 12:50:52,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:50:52,306 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 368 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:52,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1542 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-16 12:50:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 429. [2022-11-16 12:50:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 262 states have (on average 1.6145038167938932) internal successors, (423), 377 states have internal predecessors, (423), 38 states have call successors, (38), 17 states have call predecessors, (38), 19 states have return successors, (57), 34 states have call predecessors, (57), 38 states have call successors, (57) [2022-11-16 12:50:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 518 transitions. [2022-11-16 12:50:52,322 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 518 transitions. Word has length 26 [2022-11-16 12:50:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:52,323 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 518 transitions. [2022-11-16 12:50:52,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 518 transitions. [2022-11-16 12:50:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:50:52,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:52,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:52,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:50:52,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1288018164, now seen corresponding path program 1 times [2022-11-16 12:50:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:52,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795800431] [2022-11-16 12:50:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:52,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:52,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795800431] [2022-11-16 12:50:52,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795800431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:52,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:52,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491052923] [2022-11-16 12:50:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:52,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:52,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:52,649 INFO L87 Difference]: Start difference. First operand 429 states and 518 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:53,589 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2022-11-16 12:50:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-16 12:50:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:53,595 INFO L225 Difference]: With dead ends: 484 [2022-11-16 12:50:53,595 INFO L226 Difference]: Without dead ends: 484 [2022-11-16 12:50:53,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:50:53,596 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 220 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:53,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1655 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:50:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-16 12:50:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 436. [2022-11-16 12:50:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 382 states have internal predecessors, (432), 39 states have call successors, (39), 18 states have call predecessors, (39), 19 states have return successors, (54), 35 states have call predecessors, (54), 39 states have call successors, (54) [2022-11-16 12:50:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 525 transitions. [2022-11-16 12:50:53,615 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 525 transitions. Word has length 26 [2022-11-16 12:50:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:53,616 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 525 transitions. [2022-11-16 12:50:53,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 525 transitions. [2022-11-16 12:50:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:50:53,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:53,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:50:53,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1263299980, now seen corresponding path program 1 times [2022-11-16 12:50:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:53,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817511317] [2022-11-16 12:50:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:53,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817511317] [2022-11-16 12:50:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817511317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:53,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491318365] [2022-11-16 12:50:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:53,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:53,964 INFO L87 Difference]: Start difference. First operand 436 states and 525 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:55,020 INFO L93 Difference]: Finished difference Result 522 states and 665 transitions. [2022-11-16 12:50:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:50:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-16 12:50:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:55,024 INFO L225 Difference]: With dead ends: 522 [2022-11-16 12:50:55,024 INFO L226 Difference]: Without dead ends: 522 [2022-11-16 12:50:55,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:50:55,025 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 245 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:55,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1651 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-16 12:50:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2022-11-16 12:50:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 297 states have (on average 1.5892255892255893) internal successors, (472), 413 states have internal predecessors, (472), 42 states have call successors, (42), 20 states have call predecessors, (42), 23 states have return successors, (62), 38 states have call predecessors, (62), 42 states have call successors, (62) [2022-11-16 12:50:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 576 transitions. [2022-11-16 12:50:55,043 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 576 transitions. Word has length 27 [2022-11-16 12:50:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:55,044 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 576 transitions. [2022-11-16 12:50:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 576 transitions. [2022-11-16 12:50:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:50:55,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:55,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:50:55,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1263299979, now seen corresponding path program 1 times [2022-11-16 12:50:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650890363] [2022-11-16 12:50:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650890363] [2022-11-16 12:50:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650890363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:55,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:55,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515263545] [2022-11-16 12:50:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:55,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:55,210 INFO L87 Difference]: Start difference. First operand 472 states and 576 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:56,214 INFO L93 Difference]: Finished difference Result 585 states and 757 transitions. [2022-11-16 12:50:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:50:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-16 12:50:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:56,218 INFO L225 Difference]: With dead ends: 585 [2022-11-16 12:50:56,218 INFO L226 Difference]: Without dead ends: 585 [2022-11-16 12:50:56,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:50:56,219 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 292 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:56,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1625 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:50:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-11-16 12:50:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 505. [2022-11-16 12:50:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 325 states have (on average 1.5692307692307692) internal successors, (510), 442 states have internal predecessors, (510), 43 states have call successors, (43), 22 states have call predecessors, (43), 27 states have return successors, (68), 40 states have call predecessors, (68), 43 states have call successors, (68) [2022-11-16 12:50:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 621 transitions. [2022-11-16 12:50:56,238 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 621 transitions. Word has length 27 [2022-11-16 12:50:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:56,238 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 621 transitions. [2022-11-16 12:50:56,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 621 transitions. [2022-11-16 12:50:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:50:56,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:56,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:50:56,243 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1917156537, now seen corresponding path program 1 times [2022-11-16 12:50:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28432423] [2022-11-16 12:50:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:50:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:56,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28432423] [2022-11-16 12:50:56,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28432423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:56,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:56,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:50:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881353835] [2022-11-16 12:50:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:56,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:50:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:50:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:50:56,743 INFO L87 Difference]: Start difference. First operand 505 states and 621 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:58,603 INFO L93 Difference]: Finished difference Result 787 states and 1061 transitions. [2022-11-16 12:50:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:50:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-16 12:50:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:58,609 INFO L225 Difference]: With dead ends: 787 [2022-11-16 12:50:58,610 INFO L226 Difference]: Without dead ends: 787 [2022-11-16 12:50:58,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:50:58,611 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 1088 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:58,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1181 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 12:50:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-16 12:50:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 686. [2022-11-16 12:50:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 469 states have (on average 1.4989339019189765) internal successors, (703), 589 states have internal predecessors, (703), 60 states have call successors, (60), 32 states have call predecessors, (60), 47 states have return successors, (150), 64 states have call predecessors, (150), 60 states have call successors, (150) [2022-11-16 12:50:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 913 transitions. [2022-11-16 12:50:58,638 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 913 transitions. Word has length 26 [2022-11-16 12:50:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:58,638 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 913 transitions. [2022-11-16 12:50:58,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 913 transitions. [2022-11-16 12:50:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:50:58,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:58,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:58,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:50:58,643 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 496817328, now seen corresponding path program 1 times [2022-11-16 12:50:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:58,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996847855] [2022-11-16 12:50:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:58,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996847855] [2022-11-16 12:50:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996847855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:58,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:58,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989883029] [2022-11-16 12:50:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:58,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:58,819 INFO L87 Difference]: Start difference. First operand 686 states and 913 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:59,720 INFO L93 Difference]: Finished difference Result 801 states and 1108 transitions. [2022-11-16 12:50:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:50:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-16 12:50:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:59,725 INFO L225 Difference]: With dead ends: 801 [2022-11-16 12:50:59,726 INFO L226 Difference]: Without dead ends: 801 [2022-11-16 12:50:59,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:50:59,726 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 312 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:59,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1595 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:50:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-11-16 12:50:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 752. [2022-11-16 12:50:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 526 states have (on average 1.4885931558935361) internal successors, (783), 649 states have internal predecessors, (783), 62 states have call successors, (62), 35 states have call predecessors, (62), 54 states have return successors, (167), 67 states have call predecessors, (167), 62 states have call successors, (167) [2022-11-16 12:50:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1012 transitions. [2022-11-16 12:50:59,754 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1012 transitions. Word has length 28 [2022-11-16 12:50:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:59,755 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1012 transitions. [2022-11-16 12:50:59,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:50:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1012 transitions. [2022-11-16 12:50:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:50:59,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:59,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:59,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:50:59,756 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:50:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 496817329, now seen corresponding path program 1 times [2022-11-16 12:50:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:59,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782657492] [2022-11-16 12:50:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782657492] [2022-11-16 12:51:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782657492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:00,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:51:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141778277] [2022-11-16 12:51:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:51:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:51:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:51:00,055 INFO L87 Difference]: Start difference. First operand 752 states and 1012 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:01,091 INFO L93 Difference]: Finished difference Result 876 states and 1209 transitions. [2022-11-16 12:51:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-16 12:51:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:01,098 INFO L225 Difference]: With dead ends: 876 [2022-11-16 12:51:01,098 INFO L226 Difference]: Without dead ends: 876 [2022-11-16 12:51:01,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:51:01,099 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 281 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1656 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:51:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-11-16 12:51:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 844. [2022-11-16 12:51:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 601 states have (on average 1.4708818635607321) internal successors, (884), 728 states have internal predecessors, (884), 69 states have call successors, (69), 39 states have call predecessors, (69), 64 states have return successors, (197), 76 states have call predecessors, (197), 69 states have call successors, (197) [2022-11-16 12:51:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1150 transitions. [2022-11-16 12:51:01,135 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1150 transitions. Word has length 28 [2022-11-16 12:51:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:01,136 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 1150 transitions. [2022-11-16 12:51:01,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1150 transitions. [2022-11-16 12:51:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:51:01,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:01,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:01,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:51:01,138 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash -844436086, now seen corresponding path program 1 times [2022-11-16 12:51:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:01,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937379542] [2022-11-16 12:51:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:01,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937379542] [2022-11-16 12:51:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937379542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:01,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:01,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:51:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253566421] [2022-11-16 12:51:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:01,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:51:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:51:01,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:51:01,606 INFO L87 Difference]: Start difference. First operand 844 states and 1150 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:02,485 INFO L93 Difference]: Finished difference Result 807 states and 1083 transitions. [2022-11-16 12:51:02,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:51:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-16 12:51:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:02,490 INFO L225 Difference]: With dead ends: 807 [2022-11-16 12:51:02,492 INFO L226 Difference]: Without dead ends: 807 [2022-11-16 12:51:02,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:51:02,493 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 231 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:02,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 2926 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:51:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-11-16 12:51:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 760. [2022-11-16 12:51:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 535 states have (on average 1.4953271028037383) internal successors, (800), 656 states have internal predecessors, (800), 64 states have call successors, (64), 36 states have call predecessors, (64), 51 states have return successors, (164), 67 states have call predecessors, (164), 64 states have call successors, (164) [2022-11-16 12:51:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1028 transitions. [2022-11-16 12:51:02,529 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1028 transitions. Word has length 31 [2022-11-16 12:51:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:02,529 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1028 transitions. [2022-11-16 12:51:02,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1028 transitions. [2022-11-16 12:51:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:51:02,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:02,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:02,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:51:02,531 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1526253480, now seen corresponding path program 1 times [2022-11-16 12:51:02,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:02,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142384713] [2022-11-16 12:51:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142384713] [2022-11-16 12:51:02,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142384713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:02,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:51:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062287248] [2022-11-16 12:51:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:02,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:51:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:51:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:51:02,651 INFO L87 Difference]: Start difference. First operand 760 states and 1028 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:03,255 INFO L93 Difference]: Finished difference Result 814 states and 1110 transitions. [2022-11-16 12:51:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:51:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-16 12:51:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:03,261 INFO L225 Difference]: With dead ends: 814 [2022-11-16 12:51:03,261 INFO L226 Difference]: Without dead ends: 814 [2022-11-16 12:51:03,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:51:03,262 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 539 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:03,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 585 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:51:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-11-16 12:51:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 767. [2022-11-16 12:51:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 540 states have (on average 1.4796296296296296) internal successors, (799), 663 states have internal predecessors, (799), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-11-16 12:51:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1031 transitions. [2022-11-16 12:51:03,296 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1031 transitions. Word has length 32 [2022-11-16 12:51:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:03,296 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1031 transitions. [2022-11-16 12:51:03,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:51:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1031 transitions. [2022-11-16 12:51:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:51:03,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:03,297 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:51:03,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1795503433, now seen corresponding path program 1 times [2022-11-16 12:51:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:03,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436738686] [2022-11-16 12:51:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:03,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:51:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:51:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:03,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436738686] [2022-11-16 12:51:03,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436738686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:03,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:03,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:51:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714603484] [2022-11-16 12:51:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:03,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:51:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:51:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:51:03,398 INFO L87 Difference]: Start difference. First operand 767 states and 1031 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:03,885 INFO L93 Difference]: Finished difference Result 773 states and 1039 transitions. [2022-11-16 12:51:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:51:03,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-16 12:51:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:03,890 INFO L225 Difference]: With dead ends: 773 [2022-11-16 12:51:03,890 INFO L226 Difference]: Without dead ends: 773 [2022-11-16 12:51:03,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:51:03,891 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 177 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:03,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 934 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:51:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-11-16 12:51:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 765. [2022-11-16 12:51:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 540 states have (on average 1.4759259259259259) internal successors, (797), 661 states have internal predecessors, (797), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-11-16 12:51:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1029 transitions. [2022-11-16 12:51:03,916 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1029 transitions. Word has length 34 [2022-11-16 12:51:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:03,916 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1029 transitions. [2022-11-16 12:51:03,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1029 transitions. [2022-11-16 12:51:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:51:03,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:03,917 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:03,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:51:03,918 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1795503432, now seen corresponding path program 1 times [2022-11-16 12:51:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:03,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561370721] [2022-11-16 12:51:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:51:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:51:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:04,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561370721] [2022-11-16 12:51:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561370721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:04,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:51:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113523774] [2022-11-16 12:51:04,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:04,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:51:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:51:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:51:04,313 INFO L87 Difference]: Start difference. First operand 765 states and 1029 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:05,102 INFO L93 Difference]: Finished difference Result 779 states and 1045 transitions. [2022-11-16 12:51:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:51:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-16 12:51:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:05,107 INFO L225 Difference]: With dead ends: 779 [2022-11-16 12:51:05,107 INFO L226 Difference]: Without dead ends: 779 [2022-11-16 12:51:05,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:05,108 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 228 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:05,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 2561 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:51:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-11-16 12:51:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 765. [2022-11-16 12:51:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 540 states have (on average 1.474074074074074) internal successors, (796), 661 states have internal predecessors, (796), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-11-16 12:51:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1028 transitions. [2022-11-16 12:51:05,133 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1028 transitions. Word has length 34 [2022-11-16 12:51:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:05,134 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1028 transitions. [2022-11-16 12:51:05,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1028 transitions. [2022-11-16 12:51:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:51:05,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:05,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:05,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:51:05,136 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1576983610, now seen corresponding path program 1 times [2022-11-16 12:51:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:05,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892627159] [2022-11-16 12:51:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:05,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:51:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:05,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892627159] [2022-11-16 12:51:05,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892627159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:05,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:05,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:51:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339359578] [2022-11-16 12:51:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:05,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:51:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:05,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:51:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:51:05,530 INFO L87 Difference]: Start difference. First operand 765 states and 1028 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:07,356 INFO L93 Difference]: Finished difference Result 637 states and 833 transitions. [2022-11-16 12:51:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 12:51:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-16 12:51:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:07,361 INFO L225 Difference]: With dead ends: 637 [2022-11-16 12:51:07,361 INFO L226 Difference]: Without dead ends: 637 [2022-11-16 12:51:07,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:51:07,362 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1246 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:07,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1141 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:51:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-16 12:51:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 544. [2022-11-16 12:51:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 357 states have (on average 1.5434173669467788) internal successors, (551), 471 states have internal predecessors, (551), 49 states have call successors, (49), 27 states have call predecessors, (49), 31 states have return successors, (110), 45 states have call predecessors, (110), 49 states have call successors, (110) [2022-11-16 12:51:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 710 transitions. [2022-11-16 12:51:07,382 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 710 transitions. Word has length 32 [2022-11-16 12:51:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:07,382 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 710 transitions. [2022-11-16 12:51:07,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 710 transitions. [2022-11-16 12:51:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:51:07,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:07,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:51:07,384 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1916439266, now seen corresponding path program 1 times [2022-11-16 12:51:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:07,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710978134] [2022-11-16 12:51:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710978134] [2022-11-16 12:51:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710978134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:07,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:07,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:51:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550679209] [2022-11-16 12:51:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:07,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:51:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:51:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:51:07,521 INFO L87 Difference]: Start difference. First operand 544 states and 710 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:07,987 INFO L93 Difference]: Finished difference Result 606 states and 793 transitions. [2022-11-16 12:51:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:51:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-16 12:51:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:07,990 INFO L225 Difference]: With dead ends: 606 [2022-11-16 12:51:07,991 INFO L226 Difference]: Without dead ends: 604 [2022-11-16 12:51:07,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:51:07,992 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 158 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:07,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1344 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:51:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-16 12:51:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 562. [2022-11-16 12:51:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 372 states have (on average 1.5295698924731183) internal successors, (569), 487 states have internal predecessors, (569), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (106), 45 states have call predecessors, (106), 49 states have call successors, (106) [2022-11-16 12:51:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 724 transitions. [2022-11-16 12:51:08,011 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 724 transitions. Word has length 37 [2022-11-16 12:51:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:08,011 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 724 transitions. [2022-11-16 12:51:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 724 transitions. [2022-11-16 12:51:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:51:08,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:08,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:51:08,013 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash 960292098, now seen corresponding path program 1 times [2022-11-16 12:51:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:08,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765601625] [2022-11-16 12:51:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:51:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 12:51:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:08,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765601625] [2022-11-16 12:51:08,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765601625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:08,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:08,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:51:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379166704] [2022-11-16 12:51:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:08,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:51:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:51:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:51:08,439 INFO L87 Difference]: Start difference. First operand 562 states and 724 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:51:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:09,506 INFO L93 Difference]: Finished difference Result 608 states and 795 transitions. [2022-11-16 12:51:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:51:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-11-16 12:51:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:09,510 INFO L225 Difference]: With dead ends: 608 [2022-11-16 12:51:09,510 INFO L226 Difference]: Without dead ends: 601 [2022-11-16 12:51:09,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:09,511 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 275 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:09,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 2234 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:51:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-16 12:51:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 562. [2022-11-16 12:51:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 372 states have (on average 1.5268817204301075) internal successors, (568), 487 states have internal predecessors, (568), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (107), 45 states have call predecessors, (107), 49 states have call successors, (107) [2022-11-16 12:51:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 724 transitions. [2022-11-16 12:51:09,529 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 724 transitions. Word has length 36 [2022-11-16 12:51:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:09,529 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 724 transitions. [2022-11-16 12:51:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:51:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 724 transitions. [2022-11-16 12:51:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:51:09,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:09,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:09,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:51:09,531 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -615298044, now seen corresponding path program 1 times [2022-11-16 12:51:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:09,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515069787] [2022-11-16 12:51:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:09,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515069787] [2022-11-16 12:51:09,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515069787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:09,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:09,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:51:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525258783] [2022-11-16 12:51:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:51:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:51:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:51:09,945 INFO L87 Difference]: Start difference. First operand 562 states and 724 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:11,767 INFO L93 Difference]: Finished difference Result 847 states and 1194 transitions. [2022-11-16 12:51:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:51:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-16 12:51:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:11,774 INFO L225 Difference]: With dead ends: 847 [2022-11-16 12:51:11,774 INFO L226 Difference]: Without dead ends: 841 [2022-11-16 12:51:11,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2022-11-16 12:51:11,775 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 509 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:11,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 2888 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:51:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-11-16 12:51:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 769. [2022-11-16 12:51:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 649 states have internal predecessors, (794), 64 states have call successors, (64), 41 states have call predecessors, (64), 60 states have return successors, (241), 78 states have call predecessors, (241), 64 states have call successors, (241) [2022-11-16 12:51:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1099 transitions. [2022-11-16 12:51:11,809 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1099 transitions. Word has length 39 [2022-11-16 12:51:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:11,809 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1099 transitions. [2022-11-16 12:51:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1099 transitions. [2022-11-16 12:51:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:51:11,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:11,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:51:11,811 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 553374118, now seen corresponding path program 1 times [2022-11-16 12:51:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258982856] [2022-11-16 12:51:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258982856] [2022-11-16 12:51:12,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258982856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:12,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:12,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:51:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266420882] [2022-11-16 12:51:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:12,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:51:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:51:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:51:12,657 INFO L87 Difference]: Start difference. First operand 769 states and 1099 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:13,961 INFO L93 Difference]: Finished difference Result 846 states and 1263 transitions. [2022-11-16 12:51:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-16 12:51:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:13,968 INFO L225 Difference]: With dead ends: 846 [2022-11-16 12:51:13,968 INFO L226 Difference]: Without dead ends: 846 [2022-11-16 12:51:13,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:51:13,969 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 399 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:13,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1913 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:51:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-11-16 12:51:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 780. [2022-11-16 12:51:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 547 states have (on average 1.469835466179159) internal successors, (804), 658 states have internal predecessors, (804), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-11-16 12:51:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1112 transitions. [2022-11-16 12:51:14,008 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1112 transitions. Word has length 41 [2022-11-16 12:51:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:14,009 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1112 transitions. [2022-11-16 12:51:14,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1112 transitions. [2022-11-16 12:51:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:51:14,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:14,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:14,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:51:14,011 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 553374119, now seen corresponding path program 1 times [2022-11-16 12:51:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:14,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845458848] [2022-11-16 12:51:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845458848] [2022-11-16 12:51:15,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845458848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:15,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:15,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:51:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429886438] [2022-11-16 12:51:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:15,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:51:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:51:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:51:15,360 INFO L87 Difference]: Start difference. First operand 780 states and 1112 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:16,796 INFO L93 Difference]: Finished difference Result 845 states and 1262 transitions. [2022-11-16 12:51:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:51:16,797 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-16 12:51:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:16,802 INFO L225 Difference]: With dead ends: 845 [2022-11-16 12:51:16,802 INFO L226 Difference]: Without dead ends: 845 [2022-11-16 12:51:16,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:51:16,803 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 545 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:16,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1607 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:51:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-11-16 12:51:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 780. [2022-11-16 12:51:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 658 states have internal predecessors, (803), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-11-16 12:51:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1111 transitions. [2022-11-16 12:51:16,835 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1111 transitions. Word has length 41 [2022-11-16 12:51:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:16,835 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1111 transitions. [2022-11-16 12:51:16,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:51:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1111 transitions. [2022-11-16 12:51:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 12:51:16,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:16,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:16,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:51:16,837 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -783413049, now seen corresponding path program 1 times [2022-11-16 12:51:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:16,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085051189] [2022-11-16 12:51:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085051189] [2022-11-16 12:51:16,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085051189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:16,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:16,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:51:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209065538] [2022-11-16 12:51:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:16,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:51:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:51:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:51:16,932 INFO L87 Difference]: Start difference. First operand 780 states and 1111 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:17,346 INFO L93 Difference]: Finished difference Result 796 states and 1151 transitions. [2022-11-16 12:51:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:51:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-16 12:51:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:17,353 INFO L225 Difference]: With dead ends: 796 [2022-11-16 12:51:17,353 INFO L226 Difference]: Without dead ends: 796 [2022-11-16 12:51:17,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:51:17,355 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 277 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:17,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 743 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:51:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-11-16 12:51:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 778. [2022-11-16 12:51:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 656 states have internal predecessors, (799), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-11-16 12:51:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1107 transitions. [2022-11-16 12:51:17,390 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1107 transitions. Word has length 43 [2022-11-16 12:51:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:17,391 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1107 transitions. [2022-11-16 12:51:17,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1107 transitions. [2022-11-16 12:51:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 12:51:17,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:17,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:17,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:51:17,392 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash -783413048, now seen corresponding path program 1 times [2022-11-16 12:51:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:17,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219830279] [2022-11-16 12:51:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219830279] [2022-11-16 12:51:17,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219830279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:17,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:17,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:51:17,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218646000] [2022-11-16 12:51:17,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:17,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:51:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:51:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:51:17,523 INFO L87 Difference]: Start difference. First operand 778 states and 1107 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:17,926 INFO L93 Difference]: Finished difference Result 794 states and 1147 transitions. [2022-11-16 12:51:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:51:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-16 12:51:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:17,932 INFO L225 Difference]: With dead ends: 794 [2022-11-16 12:51:17,932 INFO L226 Difference]: Without dead ends: 794 [2022-11-16 12:51:17,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:51:17,933 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 271 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:17,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 746 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:51:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-11-16 12:51:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 776. [2022-11-16 12:51:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 547 states have (on average 1.453382084095064) internal successors, (795), 654 states have internal predecessors, (795), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-11-16 12:51:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1103 transitions. [2022-11-16 12:51:17,990 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1103 transitions. Word has length 43 [2022-11-16 12:51:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:17,993 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1103 transitions. [2022-11-16 12:51:17,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1103 transitions. [2022-11-16 12:51:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:51:17,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:17,994 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:17,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 12:51:17,995 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1255417078, now seen corresponding path program 1 times [2022-11-16 12:51:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729588211] [2022-11-16 12:51:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:18,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:18,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729588211] [2022-11-16 12:51:18,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729588211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:18,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:18,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135827506] [2022-11-16 12:51:18,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:18,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:18,202 INFO L87 Difference]: Start difference. First operand 776 states and 1103 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:19,050 INFO L93 Difference]: Finished difference Result 828 states and 1208 transitions. [2022-11-16 12:51:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:19,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-16 12:51:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:19,055 INFO L225 Difference]: With dead ends: 828 [2022-11-16 12:51:19,056 INFO L226 Difference]: Without dead ends: 828 [2022-11-16 12:51:19,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:19,057 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 364 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:19,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1641 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:51:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-16 12:51:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 801. [2022-11-16 12:51:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 568 states have (on average 1.4507042253521127) internal successors, (824), 676 states have internal predecessors, (824), 66 states have call successors, (66), 44 states have call predecessors, (66), 64 states have return successors, (248), 80 states have call predecessors, (248), 66 states have call successors, (248) [2022-11-16 12:51:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1138 transitions. [2022-11-16 12:51:19,085 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1138 transitions. Word has length 52 [2022-11-16 12:51:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:19,086 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1138 transitions. [2022-11-16 12:51:19,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1138 transitions. [2022-11-16 12:51:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:51:19,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:19,087 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:19,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:51:19,087 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1255417079, now seen corresponding path program 1 times [2022-11-16 12:51:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:19,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868213439] [2022-11-16 12:51:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:19,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868213439] [2022-11-16 12:51:19,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868213439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:51:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158939352] [2022-11-16 12:51:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:19,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:19,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:19,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:51:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:20,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:51:20,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:51:20,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:51:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:20,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:51:20,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158939352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:20,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:51:20,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2022-11-16 12:51:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323580331] [2022-11-16 12:51:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:51:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:51:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:51:20,314 INFO L87 Difference]: Start difference. First operand 801 states and 1138 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:20,985 INFO L93 Difference]: Finished difference Result 809 states and 1161 transitions. [2022-11-16 12:51:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:51:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-16 12:51:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:20,990 INFO L225 Difference]: With dead ends: 809 [2022-11-16 12:51:20,990 INFO L226 Difference]: Without dead ends: 809 [2022-11-16 12:51:20,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:51:20,992 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 52 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:20,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1575 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:51:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-16 12:51:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 801. [2022-11-16 12:51:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 568 states have (on average 1.448943661971831) internal successors, (823), 676 states have internal predecessors, (823), 66 states have call successors, (66), 44 states have call predecessors, (66), 64 states have return successors, (248), 80 states have call predecessors, (248), 66 states have call successors, (248) [2022-11-16 12:51:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1137 transitions. [2022-11-16 12:51:21,038 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1137 transitions. Word has length 52 [2022-11-16 12:51:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:21,038 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1137 transitions. [2022-11-16 12:51:21,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1137 transitions. [2022-11-16 12:51:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:51:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:21,040 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:21,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:51:21,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:21,246 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash 252155595, now seen corresponding path program 1 times [2022-11-16 12:51:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:21,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020817167] [2022-11-16 12:51:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020817167] [2022-11-16 12:51:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020817167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:21,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217716342] [2022-11-16 12:51:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:21,464 INFO L87 Difference]: Start difference. First operand 801 states and 1137 transitions. Second operand has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:22,543 INFO L93 Difference]: Finished difference Result 906 states and 1315 transitions. [2022-11-16 12:51:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:22,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-11-16 12:51:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:22,549 INFO L225 Difference]: With dead ends: 906 [2022-11-16 12:51:22,549 INFO L226 Difference]: Without dead ends: 906 [2022-11-16 12:51:22,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:22,550 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 358 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:22,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1701 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:51:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-16 12:51:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 812. [2022-11-16 12:51:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 577 states have (on average 1.4488734835355286) internal successors, (836), 685 states have internal predecessors, (836), 67 states have call successors, (67), 45 states have call predecessors, (67), 65 states have return successors, (251), 81 states have call predecessors, (251), 67 states have call successors, (251) [2022-11-16 12:51:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1154 transitions. [2022-11-16 12:51:22,580 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1154 transitions. Word has length 53 [2022-11-16 12:51:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:22,580 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1154 transitions. [2022-11-16 12:51:22,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1154 transitions. [2022-11-16 12:51:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:51:22,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:22,587 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:22,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-16 12:51:22,589 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 252155596, now seen corresponding path program 1 times [2022-11-16 12:51:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146919836] [2022-11-16 12:51:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146919836] [2022-11-16 12:51:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146919836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:22,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:22,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018384637] [2022-11-16 12:51:22,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:22,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:22,907 INFO L87 Difference]: Start difference. First operand 812 states and 1154 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:23,882 INFO L93 Difference]: Finished difference Result 838 states and 1218 transitions. [2022-11-16 12:51:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:51:23,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-11-16 12:51:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:23,887 INFO L225 Difference]: With dead ends: 838 [2022-11-16 12:51:23,887 INFO L226 Difference]: Without dead ends: 838 [2022-11-16 12:51:23,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:51:23,889 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 371 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:23,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1648 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:51:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-11-16 12:51:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 812. [2022-11-16 12:51:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 577 states have (on average 1.4471403812824957) internal successors, (835), 685 states have internal predecessors, (835), 67 states have call successors, (67), 45 states have call predecessors, (67), 65 states have return successors, (251), 81 states have call predecessors, (251), 67 states have call successors, (251) [2022-11-16 12:51:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1153 transitions. [2022-11-16 12:51:23,924 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1153 transitions. Word has length 53 [2022-11-16 12:51:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:23,925 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1153 transitions. [2022-11-16 12:51:23,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1153 transitions. [2022-11-16 12:51:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:51:23,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:23,926 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:23,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-16 12:51:23,926 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash -783668556, now seen corresponding path program 1 times [2022-11-16 12:51:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450609309] [2022-11-16 12:51:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:24,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450609309] [2022-11-16 12:51:24,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450609309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:24,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:24,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043359904] [2022-11-16 12:51:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:24,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:24,292 INFO L87 Difference]: Start difference. First operand 812 states and 1153 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:25,381 INFO L93 Difference]: Finished difference Result 906 states and 1333 transitions. [2022-11-16 12:51:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-16 12:51:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:25,386 INFO L225 Difference]: With dead ends: 906 [2022-11-16 12:51:25,386 INFO L226 Difference]: Without dead ends: 906 [2022-11-16 12:51:25,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:25,387 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 240 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:25,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1804 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:51:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-16 12:51:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 871. [2022-11-16 12:51:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 625 states have (on average 1.44) internal successors, (900), 734 states have internal predecessors, (900), 72 states have call successors, (72), 49 states have call predecessors, (72), 71 states have return successors, (279), 87 states have call predecessors, (279), 72 states have call successors, (279) [2022-11-16 12:51:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1251 transitions. [2022-11-16 12:51:25,417 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1251 transitions. Word has length 54 [2022-11-16 12:51:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:25,418 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1251 transitions. [2022-11-16 12:51:25,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1251 transitions. [2022-11-16 12:51:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:51:25,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:25,419 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:25,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-16 12:51:25,420 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -783668557, now seen corresponding path program 1 times [2022-11-16 12:51:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564385374] [2022-11-16 12:51:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:25,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564385374] [2022-11-16 12:51:25,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564385374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:25,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:25,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602764167] [2022-11-16 12:51:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:25,638 INFO L87 Difference]: Start difference. First operand 871 states and 1251 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:26,605 INFO L93 Difference]: Finished difference Result 957 states and 1426 transitions. [2022-11-16 12:51:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:51:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-16 12:51:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:26,611 INFO L225 Difference]: With dead ends: 957 [2022-11-16 12:51:26,611 INFO L226 Difference]: Without dead ends: 957 [2022-11-16 12:51:26,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:26,612 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 453 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:26,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1631 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:51:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-11-16 12:51:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 891. [2022-11-16 12:51:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 640 states have (on average 1.428125) internal successors, (914), 751 states have internal predecessors, (914), 72 states have call successors, (72), 49 states have call predecessors, (72), 76 states have return successors, (290), 90 states have call predecessors, (290), 72 states have call successors, (290) [2022-11-16 12:51:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1276 transitions. [2022-11-16 12:51:26,644 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1276 transitions. Word has length 54 [2022-11-16 12:51:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:26,645 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 1276 transitions. [2022-11-16 12:51:26,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1276 transitions. [2022-11-16 12:51:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:51:26,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:26,646 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:26,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-16 12:51:26,646 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1465302152, now seen corresponding path program 1 times [2022-11-16 12:51:26,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:26,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176695141] [2022-11-16 12:51:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176695141] [2022-11-16 12:51:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176695141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:26,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:26,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576526032] [2022-11-16 12:51:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:26,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:26,880 INFO L87 Difference]: Start difference. First operand 891 states and 1276 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:27,765 INFO L93 Difference]: Finished difference Result 973 states and 1450 transitions. [2022-11-16 12:51:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:51:27,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-11-16 12:51:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:27,770 INFO L225 Difference]: With dead ends: 973 [2022-11-16 12:51:27,770 INFO L226 Difference]: Without dead ends: 973 [2022-11-16 12:51:27,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:27,771 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 469 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:27,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1609 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:51:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-16 12:51:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 908. [2022-11-16 12:51:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 655 states have (on average 1.4290076335877862) internal successors, (936), 766 states have internal predecessors, (936), 73 states have call successors, (73), 50 states have call predecessors, (73), 77 states have return successors, (296), 91 states have call predecessors, (296), 73 states have call successors, (296) [2022-11-16 12:51:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1305 transitions. [2022-11-16 12:51:27,803 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1305 transitions. Word has length 55 [2022-11-16 12:51:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:27,803 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1305 transitions. [2022-11-16 12:51:27,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1305 transitions. [2022-11-16 12:51:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:51:27,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:27,804 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-16 12:51:27,805 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1465302153, now seen corresponding path program 1 times [2022-11-16 12:51:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756701514] [2022-11-16 12:51:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756701514] [2022-11-16 12:51:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756701514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:28,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:28,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:51:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510649910] [2022-11-16 12:51:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:51:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:51:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:28,130 INFO L87 Difference]: Start difference. First operand 908 states and 1305 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:29,247 INFO L93 Difference]: Finished difference Result 1018 states and 1509 transitions. [2022-11-16 12:51:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:51:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-11-16 12:51:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:29,254 INFO L225 Difference]: With dead ends: 1018 [2022-11-16 12:51:29,254 INFO L226 Difference]: Without dead ends: 1018 [2022-11-16 12:51:29,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:29,255 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 441 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:29,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1647 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:51:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-11-16 12:51:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 969. [2022-11-16 12:51:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 705 states have (on average 1.4184397163120568) internal successors, (1000), 818 states have internal predecessors, (1000), 77 states have call successors, (77), 53 states have call predecessors, (77), 84 states have return successors, (325), 97 states have call predecessors, (325), 77 states have call successors, (325) [2022-11-16 12:51:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1402 transitions. [2022-11-16 12:51:29,302 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1402 transitions. Word has length 55 [2022-11-16 12:51:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1402 transitions. [2022-11-16 12:51:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1402 transitions. [2022-11-16 12:51:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:51:29,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:29,304 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:29,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-16 12:51:29,304 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1991628466, now seen corresponding path program 1 times [2022-11-16 12:51:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:29,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775398274] [2022-11-16 12:51:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775398274] [2022-11-16 12:51:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775398274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:29,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:29,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:51:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333532188] [2022-11-16 12:51:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:29,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:51:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:51:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:51:29,879 INFO L87 Difference]: Start difference. First operand 969 states and 1402 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:31,503 INFO L93 Difference]: Finished difference Result 1512 states and 2477 transitions. [2022-11-16 12:51:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:51:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2022-11-16 12:51:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:31,514 INFO L225 Difference]: With dead ends: 1512 [2022-11-16 12:51:31,514 INFO L226 Difference]: Without dead ends: 1510 [2022-11-16 12:51:31,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-11-16 12:51:31,515 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 587 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:31,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 3101 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 12:51:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-11-16 12:51:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1323. [2022-11-16 12:51:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 983 states have (on average 1.365208545269583) internal successors, (1342), 1093 states have internal predecessors, (1342), 101 states have call successors, (101), 71 states have call predecessors, (101), 136 states have return successors, (637), 158 states have call predecessors, (637), 101 states have call successors, (637) [2022-11-16 12:51:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2080 transitions. [2022-11-16 12:51:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2080 transitions. Word has length 58 [2022-11-16 12:51:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:31,571 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 2080 transitions. [2022-11-16 12:51:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:51:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2080 transitions. [2022-11-16 12:51:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 12:51:31,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:31,573 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-16 12:51:31,573 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1101885584, now seen corresponding path program 1 times [2022-11-16 12:51:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667169362] [2022-11-16 12:51:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:32,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:32,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 12:51:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:51:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:32,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667169362] [2022-11-16 12:51:32,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667169362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:51:32,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092856239] [2022-11-16 12:51:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:32,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:32,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:51:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:33,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 12:51:33,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:51:33,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:33,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:51:33,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:51:33,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-11-16 12:51:33,577 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:33,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 72 [2022-11-16 12:51:33,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-11-16 12:51:33,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:51:33,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2022-11-16 12:51:33,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:33,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-11-16 12:51:33,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2022-11-16 12:51:33,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-16 12:51:33,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:33,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-16 12:51:33,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2022-11-16 12:51:33,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:33,804 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 12:51:33,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 12:51:33,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-11-16 12:51:33,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:33,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:34,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-16 12:51:34,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-16 12:51:34,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 12:51:34,192 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2213 Int)) (= (store |c_old(#memory_$Pointer$.base)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.base)| c_~user~0.base) c_~user~0.offset v_ArrVal_2213)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2214 Int)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.offset)| c_~user~0.base) c_~user~0.offset v_ArrVal_2214)))) (exists ((v_ArrVal_2212 (Array Int Int))) (= (store |c_old(#memory_int)| c_~user~0.base v_ArrVal_2212) |c_#memory_int|))) is different from true [2022-11-16 12:51:34,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-11-16 12:51:34,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-16 12:51:34,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:51:34,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-16 12:51:34,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 12:51:34,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:51:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:34,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:51:34,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092856239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:34,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:51:34,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 28 [2022-11-16 12:51:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685893923] [2022-11-16 12:51:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:51:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:51:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=611, Unknown=1, NotChecked=50, Total=756 [2022-11-16 12:51:34,305 INFO L87 Difference]: Start difference. First operand 1323 states and 2080 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:51:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:36,103 INFO L93 Difference]: Finished difference Result 1354 states and 2143 transitions. [2022-11-16 12:51:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:51:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2022-11-16 12:51:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:36,127 INFO L225 Difference]: With dead ends: 1354 [2022-11-16 12:51:36,127 INFO L226 Difference]: Without dead ends: 1354 [2022-11-16 12:51:36,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=1401, Unknown=6, NotChecked=78, Total=1722 [2022-11-16 12:51:36,128 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 189 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:36,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 2714 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1239 Invalid, 0 Unknown, 626 Unchecked, 1.2s Time] [2022-11-16 12:51:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-11-16 12:51:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1324. [2022-11-16 12:51:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 984 states have (on average 1.3648373983739837) internal successors, (1343), 1094 states have internal predecessors, (1343), 101 states have call successors, (101), 71 states have call predecessors, (101), 136 states have return successors, (637), 158 states have call predecessors, (637), 101 states have call successors, (637) [2022-11-16 12:51:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2081 transitions. [2022-11-16 12:51:36,176 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2081 transitions. Word has length 61 [2022-11-16 12:51:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:36,176 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 2081 transitions. [2022-11-16 12:51:36,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:51:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2081 transitions. [2022-11-16 12:51:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 12:51:36,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:36,178 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:36,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:51:36,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 12:51:36,385 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1221568528, now seen corresponding path program 1 times [2022-11-16 12:51:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424151957] [2022-11-16 12:51:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 12:51:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:51:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:36,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424151957] [2022-11-16 12:51:36,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424151957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:36,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:36,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:51:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802569376] [2022-11-16 12:51:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:36,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:51:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:51:36,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:51:36,843 INFO L87 Difference]: Start difference. First operand 1324 states and 2081 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:51:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:37,736 INFO L93 Difference]: Finished difference Result 1494 states and 2415 transitions. [2022-11-16 12:51:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:51:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2022-11-16 12:51:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:37,747 INFO L225 Difference]: With dead ends: 1494 [2022-11-16 12:51:37,747 INFO L226 Difference]: Without dead ends: 1494 [2022-11-16 12:51:37,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:51:37,748 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 380 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:37,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2608 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:51:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2022-11-16 12:51:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1461. [2022-11-16 12:51:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1093 states have (on average 1.3504117108874656) internal successors, (1476), 1206 states have internal predecessors, (1476), 113 states have call successors, (113), 78 states have call predecessors, (113), 152 states have return successors, (769), 176 states have call predecessors, (769), 113 states have call successors, (769) [2022-11-16 12:51:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2358 transitions. [2022-11-16 12:51:37,802 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2358 transitions. Word has length 61 [2022-11-16 12:51:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:37,803 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 2358 transitions. [2022-11-16 12:51:37,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:51:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2358 transitions. [2022-11-16 12:51:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:51:37,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:37,804 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-16 12:51:37,804 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash 509480719, now seen corresponding path program 1 times [2022-11-16 12:51:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571720907] [2022-11-16 12:51:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:51:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:37,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:51:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 12:51:37,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:37,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571720907] [2022-11-16 12:51:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571720907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:37,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:37,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:51:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774693827] [2022-11-16 12:51:37,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:37,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:51:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:37,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:51:37,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:51:37,944 INFO L87 Difference]: Start difference. First operand 1461 states and 2358 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:51:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:38,479 INFO L93 Difference]: Finished difference Result 1463 states and 2360 transitions. [2022-11-16 12:51:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:51:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-11-16 12:51:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:38,489 INFO L225 Difference]: With dead ends: 1463 [2022-11-16 12:51:38,489 INFO L226 Difference]: Without dead ends: 1463 [2022-11-16 12:51:38,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:51:38,490 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 305 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:38,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 922 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:51:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-11-16 12:51:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1459. [2022-11-16 12:51:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1093 states have (on average 1.3485818847209514) internal successors, (1474), 1204 states have internal predecessors, (1474), 113 states have call successors, (113), 78 states have call predecessors, (113), 152 states have return successors, (769), 176 states have call predecessors, (769), 113 states have call successors, (769) [2022-11-16 12:51:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2356 transitions. [2022-11-16 12:51:38,539 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2356 transitions. Word has length 62 [2022-11-16 12:51:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:38,540 INFO L495 AbstractCegarLoop]: Abstraction has 1459 states and 2356 transitions. [2022-11-16 12:51:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:51:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2356 transitions. [2022-11-16 12:51:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:51:38,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:38,541 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:51:38,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-16 12:51:38,542 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-16 12:51:38,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash 509480720, now seen corresponding path program 1 times [2022-11-16 12:51:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:38,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88343757] [2022-11-16 12:51:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:51:38,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:51:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:51:38,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:51:38,650 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:51:38,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2022-11-16 12:51:38,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2022-11-16 12:51:38,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2022-11-16 12:51:38,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2022-11-16 12:51:38,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2022-11-16 12:51:38,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2022-11-16 12:51:38,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2022-11-16 12:51:38,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2022-11-16 12:51:38,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2022-11-16 12:51:38,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2022-11-16 12:51:38,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2022-11-16 12:51:38,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2022-11-16 12:51:38,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2022-11-16 12:51:38,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2022-11-16 12:51:38,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2022-11-16 12:51:38,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2022-11-16 12:51:38,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2022-11-16 12:51:38,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2022-11-16 12:51:38,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2022-11-16 12:51:38,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2022-11-16 12:51:38,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2022-11-16 12:51:38,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2022-11-16 12:51:38,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2022-11-16 12:51:38,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2022-11-16 12:51:38,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2022-11-16 12:51:38,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2022-11-16 12:51:38,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2022-11-16 12:51:38,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2022-11-16 12:51:38,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2022-11-16 12:51:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2022-11-16 12:51:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2022-11-16 12:51:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2022-11-16 12:51:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2022-11-16 12:51:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2022-11-16 12:51:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2022-11-16 12:51:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2022-11-16 12:51:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2022-11-16 12:51:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2022-11-16 12:51:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2022-11-16 12:51:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2022-11-16 12:51:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2022-11-16 12:51:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2022-11-16 12:51:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2022-11-16 12:51:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2022-11-16 12:51:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2022-11-16 12:51:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2022-11-16 12:51:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2022-11-16 12:51:38,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2022-11-16 12:51:38,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2022-11-16 12:51:38,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2022-11-16 12:51:38,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2022-11-16 12:51:38,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2022-11-16 12:51:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2022-11-16 12:51:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2022-11-16 12:51:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2022-11-16 12:51:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2022-11-16 12:51:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2022-11-16 12:51:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2022-11-16 12:51:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2022-11-16 12:51:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2022-11-16 12:51:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2022-11-16 12:51:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2022-11-16 12:51:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2022-11-16 12:51:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2022-11-16 12:51:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2022-11-16 12:51:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2022-11-16 12:51:38,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2022-11-16 12:51:38,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2022-11-16 12:51:38,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2022-11-16 12:51:38,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2022-11-16 12:51:38,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2022-11-16 12:51:38,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2022-11-16 12:51:38,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2022-11-16 12:51:38,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2022-11-16 12:51:38,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2022-11-16 12:51:38,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2022-11-16 12:51:38,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2022-11-16 12:51:38,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2022-11-16 12:51:38,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2022-11-16 12:51:38,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2022-11-16 12:51:38,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2022-11-16 12:51:38,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2022-11-16 12:51:38,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2022-11-16 12:51:38,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2022-11-16 12:51:38,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2022-11-16 12:51:38,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2022-11-16 12:51:38,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2022-11-16 12:51:38,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2022-11-16 12:51:38,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2022-11-16 12:51:38,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2022-11-16 12:51:38,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2022-11-16 12:51:38,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2022-11-16 12:51:38,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2022-11-16 12:51:38,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2022-11-16 12:51:38,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2022-11-16 12:51:38,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2022-11-16 12:51:38,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2022-11-16 12:51:38,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2022-11-16 12:51:38,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2022-11-16 12:51:38,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2022-11-16 12:51:38,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2022-11-16 12:51:38,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2022-11-16 12:51:38,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2022-11-16 12:51:38,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2022-11-16 12:51:38,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2022-11-16 12:51:38,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2022-11-16 12:51:38,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2022-11-16 12:51:38,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2022-11-16 12:51:38,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2022-11-16 12:51:38,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2022-11-16 12:51:38,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2022-11-16 12:51:38,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2022-11-16 12:51:38,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2022-11-16 12:51:38,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2022-11-16 12:51:38,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2022-11-16 12:51:38,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2022-11-16 12:51:38,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2022-11-16 12:51:38,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2022-11-16 12:51:38,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2022-11-16 12:51:38,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2022-11-16 12:51:38,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2022-11-16 12:51:38,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2022-11-16 12:51:38,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2022-11-16 12:51:38,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2022-11-16 12:51:38,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2022-11-16 12:51:38,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2022-11-16 12:51:38,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2022-11-16 12:51:38,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2022-11-16 12:51:38,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2022-11-16 12:51:38,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2022-11-16 12:51:38,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2022-11-16 12:51:38,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2022-11-16 12:51:38,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2022-11-16 12:51:38,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2022-11-16 12:51:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2022-11-16 12:51:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2022-11-16 12:51:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2022-11-16 12:51:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2022-11-16 12:51:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2022-11-16 12:51:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2022-11-16 12:51:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2022-11-16 12:51:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2022-11-16 12:51:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2022-11-16 12:51:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2022-11-16 12:51:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2022-11-16 12:51:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2022-11-16 12:51:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2022-11-16 12:51:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2022-11-16 12:51:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2022-11-16 12:51:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2022-11-16 12:51:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2022-11-16 12:51:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2022-11-16 12:51:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2022-11-16 12:51:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2022-11-16 12:51:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2022-11-16 12:51:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2022-11-16 12:51:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2022-11-16 12:51:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2022-11-16 12:51:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2022-11-16 12:51:38,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2022-11-16 12:51:38,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2022-11-16 12:51:38,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2022-11-16 12:51:38,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-16 12:51:38,694 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:38,701 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:51:38,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:51:38 BoogieIcfgContainer [2022-11-16 12:51:38,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:51:38,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:51:38,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:51:38,782 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:51:38,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:41" (3/4) ... [2022-11-16 12:51:38,784 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:51:38,856 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:51:38,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:51:38,857 INFO L158 Benchmark]: Toolchain (without parser) took 59980.57ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 92.9MB in the beginning and 284.0MB in the end (delta: -191.1MB). Peak memory consumption was 128.8MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,857 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:51:38,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.53ms. Allocated memory is still 132.1MB. Free memory was 92.6MB in the beginning and 93.3MB in the end (delta: -610.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.94ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,859 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 132.1MB. Free memory was 90.4MB in the beginning and 87.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,859 INFO L158 Benchmark]: RCFGBuilder took 1447.48ms. Allocated memory is still 132.1MB. Free memory was 87.0MB in the beginning and 89.2MB in the end (delta: -2.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,859 INFO L158 Benchmark]: TraceAbstraction took 57657.66ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 89.2MB in the beginning and 288.2MB in the end (delta: -199.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,859 INFO L158 Benchmark]: Witness Printer took 75.29ms. Allocated memory is still 453.0MB. Free memory was 288.2MB in the beginning and 284.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:51:38,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.53ms. Allocated memory is still 132.1MB. Free memory was 92.6MB in the beginning and 93.3MB in the end (delta: -610.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.94ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 132.1MB. Free memory was 90.4MB in the beginning and 87.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1447.48ms. Allocated memory is still 132.1MB. Free memory was 87.0MB in the beginning and 89.2MB in the end (delta: -2.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * TraceAbstraction took 57657.66ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 89.2MB in the beginning and 288.2MB in the end (delta: -199.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. * Witness Printer took 75.29ms. Allocated memory is still 453.0MB. Free memory was 288.2MB in the beginning and 284.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; VAL [user={0:0}] [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L967] user->message.id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L968] EXPR user->info VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L968] user->info->is_valid = 0 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L969] user->status = AS_NULL VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L970] user->user_id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L971] user->timeout = 3 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; VAL [\old(argc)=95, argc=95, argv={90:84}, argv={90:84}, e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [\old(argc)=95, argc=95, argv={90:84}, argv={90:84}, e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status VAL [e={10:0}, e={10:0}, user={-1:0}, user->status=1] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={10:0}, user={-1:0}] [L838] EXPR e->primitive VAL [e={10:0}, e={10:0}, e->primitive=0, user={-1:0}] [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}, user->status=1] [L815] COND TRUE user->status != status [L816] user->status = status VAL [\old(status)=2, status=2, user={-1:0}] [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={10:0}, e={10:0}, primitive=0, status_update(AS_START)=10, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}, user->info={7:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}, user->info={7:0}, user->info->is_valid=0] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={9:0}, user={-1:0}] [L943] EXPR user->status VAL [e={9:0}, e={9:0}, user={-1:0}, user->status=2] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={9:0}, user={-1:0}] [L881] EXPR e->primitive VAL [e={9:0}, e={9:0}, e->primitive=3, user={-1:0}] [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-2:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 401 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 41, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14319 SdHoareTripleChecker+Valid, 32.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14294 mSDsluCounter, 62427 SdHoareTripleChecker+Invalid, 27.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 626 IncrementalHoareTripleChecker+Unchecked, 48880 mSDsCounter, 3831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36338 IncrementalHoareTripleChecker+Invalid, 40795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3831 mSolverCounterUnsat, 13547 mSDtfsCounter, 36338 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 533 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1461occurred in iteration=39, InterpolantAutomatonStates: 452, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 2044 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1507 ConstructedInterpolants, 6 QuantifiedInterpolants, 8342 SizeOfPredicates, 29 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 42 InterpolantComputations, 40 PerfectInterpolantSequences, 93/97 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:51:38,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd56d21d-e1e4-4d64-aa9e-9e51d13b5baf/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)