./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN --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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- 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-6b4ec56 [2022-11-20 10:30:00,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:00,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:00,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:00,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:00,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:00,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:00,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:00,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:00,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:00,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:00,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:00,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:00,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:00,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:00,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:00,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:00,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:00,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:00,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:00,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:00,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:00,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:00,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:00,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:00,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:00,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:00,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:00,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:00,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:00,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:00,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:00,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:00,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:00,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:00,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:00,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:00,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:00,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:00,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:00,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:00,901 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:30:00,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:00,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:00,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:00,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:00,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:00,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:00,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:00,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:00,970 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:00,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:00,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:00,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:00,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:00,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:00,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:00,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:00,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:00,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:00,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:00,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:00,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:00,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:00,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:00,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:00,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:00,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:00,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:00,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:00,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:00,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:00,977 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:00,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:00,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:00,978 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_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/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_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2022-11-20 10:30:01,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:01,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:01,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:01,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:01,317 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:01,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-20 10:30:04,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:04,538 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:04,538 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-20 10:30:04,547 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/data/f3227caf7/9f368c1ed070469ebda58f22d00cafc4/FLAG812a349e7 [2022-11-20 10:30:04,564 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/data/f3227caf7/9f368c1ed070469ebda58f22d00cafc4 [2022-11-20 10:30:04,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:04,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:04,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:04,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:04,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:04,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621fe9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:04, skipping insertion in model container [2022-11-20 10:30:04,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:04,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:04,809 WARN L237 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_6bcfeb64-1447-4714-a927-c235950e0b2a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-20 10:30:04,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:04,922 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:04,937 WARN L237 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_6bcfeb64-1447-4714-a927-c235950e0b2a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-20 10:30:04,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:05,018 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:05,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05 WrapperNode [2022-11-20 10:30:05,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:05,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:05,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:05,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,090 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2022-11-20 10:30:05,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:05,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:05,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:05,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:05,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:05,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:05,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:05,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 10:30:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 10:30:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-20 10:30:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-20 10:30:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 10:30:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 10:30:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 10:30:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 10:30:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 10:30:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 10:30:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 10:30:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 10:30:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 10:30:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 10:30:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-20 10:30:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-20 10:30:05,386 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:05,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:05,722 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:05,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:05,730 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:30:05,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05 BoogieIcfgContainer [2022-11-20 10:30:05,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:05,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:05,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:05,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:05,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:04" (1/3) ... [2022-11-20 10:30:05,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f9131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:05, skipping insertion in model container [2022-11-20 10:30:05,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (2/3) ... [2022-11-20 10:30:05,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f9131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:05, skipping insertion in model container [2022-11-20 10:30:05,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05" (3/3) ... [2022-11-20 10:30:05,744 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-11-20 10:30:05,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:05,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:30:05,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:05,903 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;@71a2ff70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:05,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:30:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:30:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:05,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:05,925 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, 1, 1] [2022-11-20 10:30:05,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-11-20 10:30:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:05,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115896384] [2022-11-20 10:30:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:06,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115896384] [2022-11-20 10:30:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115896384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:06,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:06,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220166343] [2022-11-20 10:30:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:06,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:06,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:06,579 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:07,149 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2022-11-20 10:30:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:07,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-20 10:30:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:07,163 INFO L225 Difference]: With dead ends: 217 [2022-11-20 10:30:07,163 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 10:30:07,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:30:07,173 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 214 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:07,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 240 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:30:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 10:30:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-20 10:30:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:30:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-11-20 10:30:07,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-11-20 10:30:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:07,244 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-11-20 10:30:07,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-11-20 10:30:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:07,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:07,253 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, 1, 1] [2022-11-20 10:30:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:07,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-11-20 10:30:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:07,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010916658] [2022-11-20 10:30:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,665 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-20 10:30:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010916658] [2022-11-20 10:30:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010916658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:07,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:07,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946031855] [2022-11-20 10:30:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:30:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:30:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:07,670 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:08,344 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2022-11-20 10:30:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:30:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-20 10:30:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:08,347 INFO L225 Difference]: With dead ends: 323 [2022-11-20 10:30:08,348 INFO L226 Difference]: Without dead ends: 234 [2022-11-20 10:30:08,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:30:08,350 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 491 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:08,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 304 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:30:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-20 10:30:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-11-20 10:30:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-11-20 10:30:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-11-20 10:30:08,388 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-11-20 10:30:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:08,388 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-11-20 10:30:08,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-11-20 10:30:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:08,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:08,390 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, 1, 1] [2022-11-20 10:30:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:08,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-11-20 10:30:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128416876] [2022-11-20 10:30:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,612 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-20 10:30:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:08,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128416876] [2022-11-20 10:30:08,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128416876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:08,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:08,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046153771] [2022-11-20 10:30:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:08,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:30:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:30:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:08,617 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,479 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-11-20 10:30:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:30:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-20 10:30:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:09,491 INFO L225 Difference]: With dead ends: 543 [2022-11-20 10:30:09,491 INFO L226 Difference]: Without dead ends: 365 [2022-11-20 10:30:09,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:30:09,500 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 444 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:09,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 583 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:30:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-20 10:30:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2022-11-20 10:30:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-11-20 10:30:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2022-11-20 10:30:09,585 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2022-11-20 10:30:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:09,586 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2022-11-20 10:30:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2022-11-20 10:30:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:09,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:09,590 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, 1, 1] [2022-11-20 10:30:09,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:30:09,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2022-11-20 10:30:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89442802] [2022-11-20 10:30:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,765 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-20 10:30:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89442802] [2022-11-20 10:30:09,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89442802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106722759] [2022-11-20 10:30:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:09,771 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:30:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:10,338 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2022-11-20 10:30:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:30:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-11-20 10:30:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:10,341 INFO L225 Difference]: With dead ends: 592 [2022-11-20 10:30:10,341 INFO L226 Difference]: Without dead ends: 324 [2022-11-20 10:30:10,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:30:10,343 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:10,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 494 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:30:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-20 10:30:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2022-11-20 10:30:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-11-20 10:30:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2022-11-20 10:30:10,380 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2022-11-20 10:30:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2022-11-20 10:30:10,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:30:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2022-11-20 10:30:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:10,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:10,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:10,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:30:10,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2022-11-20 10:30:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229367888] [2022-11-20 10:30:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,543 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-20 10:30:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229367888] [2022-11-20 10:30:10,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229367888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:10,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:10,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672416519] [2022-11-20 10:30:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:10,546 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:30:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:12,616 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2022-11-20 10:30:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 10:30:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2022-11-20 10:30:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:12,627 INFO L225 Difference]: With dead ends: 1963 [2022-11-20 10:30:12,627 INFO L226 Difference]: Without dead ends: 1690 [2022-11-20 10:30:12,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 10:30:12,632 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1197 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:12,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 753 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 10:30:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-11-20 10:30:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2022-11-20 10:30:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-11-20 10:30:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2022-11-20 10:30:12,832 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2022-11-20 10:30:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:12,833 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2022-11-20 10:30:12,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:30:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2022-11-20 10:30:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:12,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:12,835 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, 1, 1] [2022-11-20 10:30:12,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:12,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2022-11-20 10:30:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:12,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628785875] [2022-11-20 10:30:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,076 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-20 10:30:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:13,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628785875] [2022-11-20 10:30:13,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628785875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:13,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:13,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645429522] [2022-11-20 10:30:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:13,079 INFO L87 Difference]: Start difference. First operand 1432 states and 1877 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:30:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:13,755 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2022-11-20 10:30:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:30:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-11-20 10:30:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:13,765 INFO L225 Difference]: With dead ends: 3031 [2022-11-20 10:30:13,765 INFO L226 Difference]: Without dead ends: 1621 [2022-11-20 10:30:13,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:30:13,770 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 169 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:13,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 443 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:30:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-20 10:30:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2022-11-20 10:30:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-11-20 10:30:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2022-11-20 10:30:13,907 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2022-11-20 10:30:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:13,907 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2022-11-20 10:30:13,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:30:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2022-11-20 10:30:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:13,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:13,909 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, 1, 1] [2022-11-20 10:30:13,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:30:13,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2022-11-20 10:30:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:13,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513402665] [2022-11-20 10:30:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:30:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:30:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:30:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:30:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,079 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-20 10:30:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:14,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513402665] [2022-11-20 10:30:14,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513402665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:14,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:14,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434988539] [2022-11-20 10:30:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:14,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:30:14,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:30:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:14,082 INFO L87 Difference]: Start difference. First operand 1477 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:14,954 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2022-11-20 10:30:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:30:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-20 10:30:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:14,961 INFO L225 Difference]: With dead ends: 2912 [2022-11-20 10:30:14,962 INFO L226 Difference]: Without dead ends: 1676 [2022-11-20 10:30:14,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:30:14,965 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 338 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:14,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 407 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:30:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-11-20 10:30:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2022-11-20 10:30:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-11-20 10:30:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2022-11-20 10:30:15,079 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2022-11-20 10:30:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:15,079 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2022-11-20 10:30:15,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:30:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2022-11-20 10:30:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:30:15,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:15,080 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, 1, 1] [2022-11-20 10:30:15,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:30:15,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:15,082 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-11-20 10:30:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:15,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887765626] [2022-11-20 10:30:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:15,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:15,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:15,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:15,157 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:30:15,158 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:30:15,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:30:15,163 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:15,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:30:15,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:30:15 BoogieIcfgContainer [2022-11-20 10:30:15,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:30:15,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:30:15,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:30:15,240 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:30:15,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05" (3/4) ... [2022-11-20 10:30:15,242 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:30:15,322 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:30:15,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:30:15,323 INFO L158 Benchmark]: Toolchain (without parser) took 10754.73ms. Allocated memory was 115.3MB in the beginning and 205.5MB in the end (delta: 90.2MB). Free memory was 73.1MB in the beginning and 84.3MB in the end (delta: -11.3MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,323 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:30:15,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.82ms. Allocated memory is still 115.3MB. Free memory was 72.6MB in the beginning and 60.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.11ms. Allocated memory is still 115.3MB. Free memory was 60.0MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,324 INFO L158 Benchmark]: Boogie Preprocessor took 59.11ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,324 INFO L158 Benchmark]: RCFGBuilder took 582.13ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 39.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,325 INFO L158 Benchmark]: TraceAbstraction took 9503.50ms. Allocated memory was 115.3MB in the beginning and 205.5MB in the end (delta: 90.2MB). Free memory was 38.7MB in the beginning and 89.5MB in the end (delta: -50.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,325 INFO L158 Benchmark]: Witness Printer took 82.45ms. Allocated memory is still 205.5MB. Free memory was 89.5MB in the beginning and 84.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:30:15,327 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.38ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.82ms. Allocated memory is still 115.3MB. Free memory was 72.6MB in the beginning and 60.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.11ms. Allocated memory is still 115.3MB. Free memory was 60.0MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.11ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.13ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 39.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9503.50ms. Allocated memory was 115.3MB in the beginning and 205.5MB in the end (delta: 90.2MB). Free memory was 38.7MB in the beginning and 89.5MB in the end (delta: -50.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 82.45ms. Allocated memory is still 205.5MB. Free memory was 89.5MB in the beginning and 84.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] CALL update_channels() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L222] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] COND TRUE (int )c_dr_i == 1 [L243] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] RET init_threads() [L414] CALL fire_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L275] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L280] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL activate_threads() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L308] int tmp ; [L309] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L62] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L75] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L77] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_write_p_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] tmp = is_do_write_p_triggered() [L315] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L81] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L94] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L96] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L321] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_read_c_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] tmp___0 = is_do_read_c_triggered() [L323] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] CALL reset_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L293] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L419] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L252] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L255] COND TRUE (int )p_dw_st == 0 [L256] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L268] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] tmp___1 = exists_runnable_thread() [L344] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L359] CALL error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L20] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3018 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2973 mSDsluCounter, 3224 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2418 mSDsCounter, 848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3784 IncrementalHoareTripleChecker+Invalid, 4632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 848 mSolverCounterUnsat, 806 mSDtfsCounter, 3784 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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-20 10:30:15,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bcfeb64-1447-4714-a927-c235950e0b2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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