./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/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_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- 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 11:21:48,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:21:48,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:21:48,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:21:48,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:21:48,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:21:48,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:21:48,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:21:48,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:21:48,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:21:48,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:21:48,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:21:48,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:21:48,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:21:48,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:21:48,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:21:48,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:21:48,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:21:48,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:21:48,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:21:48,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:21:48,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:21:48,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:21:48,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:21:48,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:21:48,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:21:48,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:21:48,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:21:48,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:21:48,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:21:48,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:21:48,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:21:48,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:21:48,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:21:48,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:21:48,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:21:48,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:21:48,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:21:48,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:21:48,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:21:48,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:21:48,702 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:21:48,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:21:48,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:21:48,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:21:48,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:21:48,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:21:48,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:21:48,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:21:48,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:21:48,752 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:21:48,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:21:48,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:21:48,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:21:48,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:21:48,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:21:48,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:21:48,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:21:48,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:21:48,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:21:48,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:21:48,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:21:48,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:21:48,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:21:48,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:21:48,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:21:48,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:21:48,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:21:48,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:21:48,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:21:48,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:21:48,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:21:48,757 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:21:48,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:21:48,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:21:48,758 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_720029ed-0911-416e-b79d-457880c47e52/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_720029ed-0911-416e-b79d-457880c47e52/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2022-11-16 11:21:49,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:21:49,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:21:49,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:21:49,065 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:21:49,066 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:21:49,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-11-16 11:21:49,131 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/data/1db9a5d32/2ea1c22f86eb4016b5dbe5aee3967b36/FLAG86d15dd44 [2022-11-16 11:21:49,611 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:21:49,612 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-11-16 11:21:49,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/data/1db9a5d32/2ea1c22f86eb4016b5dbe5aee3967b36/FLAG86d15dd44 [2022-11-16 11:21:49,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/data/1db9a5d32/2ea1c22f86eb4016b5dbe5aee3967b36 [2022-11-16 11:21:49,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:21:49,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:21:49,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:21:49,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:21:50,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:21:50,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:49" (1/1) ... [2022-11-16 11:21:50,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4aaa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50, skipping insertion in model container [2022-11-16 11:21:50,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:49" (1/1) ... [2022-11-16 11:21:50,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:21:50,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:21:50,236 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_720029ed-0911-416e-b79d-457880c47e52/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2022-11-16 11:21:50,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:21:50,284 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:21:50,294 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_720029ed-0911-416e-b79d-457880c47e52/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2022-11-16 11:21:50,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:21:50,329 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:21:50,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50 WrapperNode [2022-11-16 11:21:50,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:21:50,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:21:50,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:21:50,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:21:50,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,375 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2022-11-16 11:21:50,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:21:50,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:21:50,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:21:50,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:21:50,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:21:50,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:21:50,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:21:50,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:21:50,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (1/1) ... [2022-11-16 11:21:50,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:21:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:50,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:21:50,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:21:50,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:21:50,508 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-16 11:21:50,508 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-16 11:21:50,508 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-16 11:21:50,509 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-16 11:21:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-16 11:21:50,509 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-16 11:21:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-16 11:21:50,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-16 11:21:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:21:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-16 11:21:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-16 11:21:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:21:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:21:50,577 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:21:50,579 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:21:50,821 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:21:50,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:21:50,829 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 11:21:50,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:21:50 BoogieIcfgContainer [2022-11-16 11:21:50,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:21:50,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:21:50,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:21:50,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:21:50,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:21:49" (1/3) ... [2022-11-16 11:21:50,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a98adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:21:50, skipping insertion in model container [2022-11-16 11:21:50,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:50" (2/3) ... [2022-11-16 11:21:50,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a98adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:21:50, skipping insertion in model container [2022-11-16 11:21:50,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:21:50" (3/3) ... [2022-11-16 11:21:50,841 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2022-11-16 11:21:50,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:21:50,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:21:50,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:21:50,922 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ed1d3cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:21:50,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:21:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-16 11:21:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:50,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:50,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:50,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash -20293138, now seen corresponding path program 1 times [2022-11-16 11:21:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680360637] [2022-11-16 11:21:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:51,610 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 11:21:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:51,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680360637] [2022-11-16 11:21:51,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680360637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:51,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:51,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448476188] [2022-11-16 11:21:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:51,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:51,681 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:52,259 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2022-11-16 11:21:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:21:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:52,283 INFO L225 Difference]: With dead ends: 210 [2022-11-16 11:21:52,288 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 11:21:52,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:21:52,295 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 207 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:52,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 318 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:21:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 11:21:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-11-16 11:21:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.381578947368421) internal successors, (105), 77 states have internal predecessors, (105), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-16 11:21:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2022-11-16 11:21:52,352 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 55 [2022-11-16 11:21:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:52,353 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2022-11-16 11:21:52,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2022-11-16 11:21:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:52,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:52,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:52,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:21:52,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -917686416, now seen corresponding path program 1 times [2022-11-16 11:21:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600508986] [2022-11-16 11:21:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:52,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 11:21:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:52,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600508986] [2022-11-16 11:21:52,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600508986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:52,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:52,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377436610] [2022-11-16 11:21:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:52,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:52,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:52,675 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:53,427 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2022-11-16 11:21:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:21:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:53,432 INFO L225 Difference]: With dead ends: 334 [2022-11-16 11:21:53,432 INFO L226 Difference]: Without dead ends: 248 [2022-11-16 11:21:53,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:21:53,435 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 345 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:53,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 594 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:21:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-16 11:21:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2022-11-16 11:21:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 143 states have internal predecessors, (195), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-11-16 11:21:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2022-11-16 11:21:53,490 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 55 [2022-11-16 11:21:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:53,490 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2022-11-16 11:21:53,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2022-11-16 11:21:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:53,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:53,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:53,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:21:53,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash -669539922, now seen corresponding path program 1 times [2022-11-16 11:21:53,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:53,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018357203] [2022-11-16 11:21:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:53,587 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 11:21:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:53,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018357203] [2022-11-16 11:21:53,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018357203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:53,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:53,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:21:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665151914] [2022-11-16 11:21:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:53,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:21:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:21:53,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:21:53,591 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:54,112 INFO L93 Difference]: Finished difference Result 457 states and 644 transitions. [2022-11-16 11:21:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:21:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:54,115 INFO L225 Difference]: With dead ends: 457 [2022-11-16 11:21:54,116 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 11:21:54,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:21:54,119 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 354 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:54,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 445 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:21:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 11:21:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2022-11-16 11:21:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 199 states have internal predecessors, (268), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-16 11:21:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2022-11-16 11:21:54,160 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 55 [2022-11-16 11:21:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:54,160 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2022-11-16 11:21:54,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2022-11-16 11:21:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:54,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:54,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:54,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:21:54,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 455720047, now seen corresponding path program 1 times [2022-11-16 11:21:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060889004] [2022-11-16 11:21:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,282 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 11:21:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:54,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060889004] [2022-11-16 11:21:54,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060889004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:54,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:54,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127643722] [2022-11-16 11:21:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:54,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:54,285 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:54,759 INFO L93 Difference]: Finished difference Result 519 states and 731 transitions. [2022-11-16 11:21:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:21:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:54,762 INFO L225 Difference]: With dead ends: 519 [2022-11-16 11:21:54,762 INFO L226 Difference]: Without dead ends: 286 [2022-11-16 11:21:54,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:21:54,764 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 157 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:54,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 428 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:21:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-16 11:21:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2022-11-16 11:21:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.3585858585858586) internal successors, (269), 202 states have internal predecessors, (269), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-16 11:21:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2022-11-16 11:21:54,797 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 55 [2022-11-16 11:21:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:54,798 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2022-11-16 11:21:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2022-11-16 11:21:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:54,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:54,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:54,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:21:54,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash 383333489, now seen corresponding path program 1 times [2022-11-16 11:21:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776078489] [2022-11-16 11:21:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:54,948 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 11:21:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:54,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776078489] [2022-11-16 11:21:54,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776078489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:54,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:54,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810331766] [2022-11-16 11:21:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:54,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:54,952 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:55,442 INFO L93 Difference]: Finished difference Result 531 states and 743 transitions. [2022-11-16 11:21:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:21:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:55,444 INFO L225 Difference]: With dead ends: 531 [2022-11-16 11:21:55,444 INFO L226 Difference]: Without dead ends: 295 [2022-11-16 11:21:55,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:21:55,447 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 121 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:55,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 423 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:21:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-16 11:21:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2022-11-16 11:21:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 211 states have internal predecessors, (278), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-16 11:21:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2022-11-16 11:21:55,496 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 55 [2022-11-16 11:21:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:55,496 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2022-11-16 11:21:55,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2022-11-16 11:21:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:55,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:55,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:55,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:21:55,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1988405773, now seen corresponding path program 1 times [2022-11-16 11:21:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:55,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922871551] [2022-11-16 11:21:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:55,641 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 11:21:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:55,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922871551] [2022-11-16 11:21:55,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922871551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:55,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:55,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508068871] [2022-11-16 11:21:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:55,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:55,647 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:56,109 INFO L93 Difference]: Finished difference Result 654 states and 887 transitions. [2022-11-16 11:21:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:21:56,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:56,115 INFO L225 Difference]: With dead ends: 654 [2022-11-16 11:21:56,116 INFO L226 Difference]: Without dead ends: 476 [2022-11-16 11:21:56,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:21:56,119 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 378 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:56,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 350 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:21:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-16 11:21:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2022-11-16 11:21:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 337 states have (on average 1.3293768545994065) internal successors, (448), 343 states have internal predecessors, (448), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-11-16 11:21:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2022-11-16 11:21:56,184 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 55 [2022-11-16 11:21:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:56,185 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2022-11-16 11:21:56,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2022-11-16 11:21:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:56,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:56,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:56,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:21:56,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 501123189, now seen corresponding path program 1 times [2022-11-16 11:21:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:56,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457578226] [2022-11-16 11:21:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,350 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 11:21:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:56,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457578226] [2022-11-16 11:21:56,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457578226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:56,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:56,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:21:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366522611] [2022-11-16 11:21:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:56,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:21:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:21:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:21:56,353 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:56,649 INFO L93 Difference]: Finished difference Result 848 states and 1126 transitions. [2022-11-16 11:21:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:21:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:56,653 INFO L225 Difference]: With dead ends: 848 [2022-11-16 11:21:56,653 INFO L226 Difference]: Without dead ends: 448 [2022-11-16 11:21:56,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:21:56,657 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 232 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:56,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 296 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:21:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-11-16 11:21:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2022-11-16 11:21:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 336 states have (on average 1.2946428571428572) internal successors, (435), 342 states have internal predecessors, (435), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-11-16 11:21:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-11-16 11:21:56,716 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-11-16 11:21:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:56,716 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-11-16 11:21:56,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-11-16 11:21:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:21:56,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:56,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:56,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:21:56,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 719977907, now seen corresponding path program 1 times [2022-11-16 11:21:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:56,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088481149] [2022-11-16 11:21:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:56,829 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 11:21:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:56,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088481149] [2022-11-16 11:21:56,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088481149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:56,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:21:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38919460] [2022-11-16 11:21:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:56,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:21:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:21:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:21:56,832 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:57,223 INFO L93 Difference]: Finished difference Result 1248 states and 1632 transitions. [2022-11-16 11:21:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:21:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-16 11:21:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:57,230 INFO L225 Difference]: With dead ends: 1248 [2022-11-16 11:21:57,231 INFO L226 Difference]: Without dead ends: 849 [2022-11-16 11:21:57,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:21:57,233 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 344 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:57,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 267 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:21:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-16 11:21:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 787. [2022-11-16 11:21:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 644 states have (on average 1.2763975155279503) internal successors, (822), 655 states have internal predecessors, (822), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2022-11-16 11:21:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1020 transitions. [2022-11-16 11:21:57,334 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1020 transitions. Word has length 55 [2022-11-16 11:21:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:57,335 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1020 transitions. [2022-11-16 11:21:57,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:21:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1020 transitions. [2022-11-16 11:21:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 11:21:57,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:57,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:21:57,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1595512707, now seen corresponding path program 1 times [2022-11-16 11:21:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:57,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040342818] [2022-11-16 11:21:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:57,418 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 11:21:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:57,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040342818] [2022-11-16 11:21:57,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040342818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:57,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:57,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:21:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068822738] [2022-11-16 11:21:57,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:21:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:21:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:21:57,422 INFO L87 Difference]: Start difference. First operand 787 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-16 11:21:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:57,822 INFO L93 Difference]: Finished difference Result 2374 states and 3066 transitions. [2022-11-16 11:21:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:21:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2022-11-16 11:21:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:57,831 INFO L225 Difference]: With dead ends: 2374 [2022-11-16 11:21:57,831 INFO L226 Difference]: Without dead ends: 1601 [2022-11-16 11:21:57,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:21:57,838 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 274 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:57,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 254 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:21:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-16 11:21:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1471. [2022-11-16 11:21:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1193 states have (on average 1.2514668901927912) internal successors, (1493), 1213 states have internal predecessors, (1493), 163 states have call successors, (163), 100 states have call predecessors, (163), 114 states have return successors, (217), 161 states have call predecessors, (217), 163 states have call successors, (217) [2022-11-16 11:21:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1873 transitions. [2022-11-16 11:21:58,002 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1873 transitions. Word has length 56 [2022-11-16 11:21:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:58,003 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1873 transitions. [2022-11-16 11:21:58,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-16 11:21:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1873 transitions. [2022-11-16 11:21:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:21:58,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:58,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:58,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:21:58,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1907953452, now seen corresponding path program 1 times [2022-11-16 11:21:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144127917] [2022-11-16 11:21:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:21:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:21:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:21:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:21:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:21:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:21:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:21:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144127917] [2022-11-16 11:21:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144127917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:21:58,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:21:58,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:21:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461434739] [2022-11-16 11:21:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:21:58,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:21:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:21:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:21:58,130 INFO L87 Difference]: Start difference. First operand 1471 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:21:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:59,045 INFO L93 Difference]: Finished difference Result 4511 states and 5775 transitions. [2022-11-16 11:21:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:21:59,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-16 11:21:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:59,056 INFO L225 Difference]: With dead ends: 4511 [2022-11-16 11:21:59,056 INFO L226 Difference]: Without dead ends: 2340 [2022-11-16 11:21:59,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:21:59,064 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 518 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:59,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 487 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:21:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-11-16 11:21:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2209. [2022-11-16 11:21:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1786 states have (on average 1.232922732362822) internal successors, (2202), 1825 states have internal predecessors, (2202), 241 states have call successors, (241), 150 states have call predecessors, (241), 181 states have return successors, (375), 237 states have call predecessors, (375), 241 states have call successors, (375) [2022-11-16 11:21:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2818 transitions. [2022-11-16 11:21:59,310 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2818 transitions. Word has length 73 [2022-11-16 11:21:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:59,310 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 2818 transitions. [2022-11-16 11:21:59,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:21:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2818 transitions. [2022-11-16 11:21:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-16 11:21:59,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:59,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:59,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:21:59,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 175805213, now seen corresponding path program 1 times [2022-11-16 11:21:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:59,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967891210] [2022-11-16 11:21:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:59,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:59,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:59,364 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:21:59,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:21:59,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:21:59,370 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:59,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:21:59,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:21:59 BoogieIcfgContainer [2022-11-16 11:21:59,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:21:59,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:21:59,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:21:59,437 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:21:59,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:21:50" (3/4) ... [2022-11-16 11:21:59,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:21:59,523 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:21:59,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:21:59,524 INFO L158 Benchmark]: Toolchain (without parser) took 9529.42ms. Allocated memory was 104.9MB in the beginning and 188.7MB in the end (delta: 83.9MB). Free memory was 61.3MB in the beginning and 51.4MB in the end (delta: 9.9MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,525 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:21:59,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.73ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 78.1MB in the end (delta: -17.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.90ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 76.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,526 INFO L158 Benchmark]: Boogie Preprocessor took 24.89ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 74.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,526 INFO L158 Benchmark]: RCFGBuilder took 429.54ms. Allocated memory is still 104.9MB. Free memory was 74.5MB in the beginning and 58.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,529 INFO L158 Benchmark]: TraceAbstraction took 8603.20ms. Allocated memory was 104.9MB in the beginning and 188.7MB in the end (delta: 83.9MB). Free memory was 57.7MB in the beginning and 58.7MB in the end (delta: -984.6kB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,529 INFO L158 Benchmark]: Witness Printer took 86.30ms. Allocated memory is still 188.7MB. Free memory was 58.7MB in the beginning and 51.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:21:59,532 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.23ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.73ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 78.1MB in the end (delta: -17.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.90ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 76.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.89ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 74.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.54ms. Allocated memory is still 104.9MB. Free memory was 74.5MB in the beginning and 58.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8603.20ms. Allocated memory was 104.9MB in the beginning and 188.7MB in the end (delta: 83.9MB). Free memory was 57.7MB in the beginning and 58.7MB in the end (delta: -984.6kB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 86.30ms. Allocated memory is still 188.7MB. Free memory was 58.7MB in the beginning and 51.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int m_st ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L29] int m_i ; [L33] int E_1 = 2; [L25] int m_pc = 0; [L28] int t1_st ; [L26] int t1_pc = 0; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3019 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2930 mSDsluCounter, 3862 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2766 mSDsCounter, 526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3483 IncrementalHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 526 mSolverCounterUnsat, 1096 mSDtfsCounter, 3483 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2209occurred in iteration=10, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 646 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 14/14 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 11:21:59,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720029ed-0911-416e-b79d-457880c47e52/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