./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G --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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:28:23,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:28:23,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:28:23,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:28:23,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:28:23,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:28:23,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:28:23,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:28:23,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:28:23,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:28:23,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:28:23,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:28:23,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:28:23,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:28:23,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:28:23,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:28:23,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:28:23,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:28:23,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:28:23,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:28:23,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:28:23,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:28:24,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:28:24,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:28:24,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:28:24,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:28:24,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:28:24,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:28:24,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:28:24,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:28:24,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:28:24,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:28:24,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:28:24,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:28:24,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:28:24,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:28:24,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:28:24,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:28:24,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:28:24,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:28:24,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:28:24,038 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:28:24,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:28:24,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:28:24,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:28:24,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:28:24,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:28:24,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:28:24,107 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:28:24,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:28:24,107 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:28:24,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:28:24,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:28:24,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:28:24,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:28:24,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:28:24,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:28:24,111 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:28:24,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:28:24,111 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:28:24,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:28:24,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:28:24,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:28:24,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:28:24,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:28:24,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:28:24,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:28:24,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:28:24,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:28:24,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:28:24,114 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:28:24,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:28:24,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:28:24,117 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:28:24,117 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_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/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_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2021-11-23 13:28:24,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:28:24,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:28:24,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:28:24,520 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:28:24,521 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:28:24,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2021-11-23 13:28:24,632 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/data/806e50392/d40e3404430141c0b4676dcd1a4b012c/FLAG2fd3cf7e3 [2021-11-23 13:28:25,222 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:28:25,223 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2021-11-23 13:28:25,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/data/806e50392/d40e3404430141c0b4676dcd1a4b012c/FLAG2fd3cf7e3 [2021-11-23 13:28:25,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/data/806e50392/d40e3404430141c0b4676dcd1a4b012c [2021-11-23 13:28:25,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:28:25,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:28:25,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:28:25,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:28:25,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:28:25,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:25" (1/1) ... [2021-11-23 13:28:25,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77136455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:25, skipping insertion in model container [2021-11-23 13:28:25,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:25" (1/1) ... [2021-11-23 13:28:25,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:28:25,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:28:25,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2021-11-23 13:28:25,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2021-11-23 13:28:25,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:28:25,954 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:28:25,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2021-11-23 13:28:25,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2021-11-23 13:28:26,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:28:26,064 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:28:26,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26 WrapperNode [2021-11-23 13:28:26,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:28:26,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:28:26,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:28:26,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:28:26,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,171 INFO L137 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 47, calls inlined = 58, statements flattened = 700 [2021-11-23 13:28:26,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:28:26,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:28:26,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:28:26,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:28:26,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:28:26,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:28:26,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:28:26,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:28:26,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (1/1) ... [2021-11-23 13:28:26,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:28:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:28:26,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:28:26,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:28:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:28:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:28:26,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:28:26,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:28:26,466 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:28:26,468 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:28:27,259 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:28:27,273 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:28:27,273 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-23 13:28:27,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:27 BoogieIcfgContainer [2021-11-23 13:28:27,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:28:27,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:28:27,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:28:27,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:28:27,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:28:25" (1/3) ... [2021-11-23 13:28:27,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9581f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:27, skipping insertion in model container [2021-11-23 13:28:27,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:26" (2/3) ... [2021-11-23 13:28:27,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9581f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:27, skipping insertion in model container [2021-11-23 13:28:27,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:27" (3/3) ... [2021-11-23 13:28:27,287 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2021-11-23 13:28:27,295 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:28:27,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-23 13:28:27,360 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:28:27,370 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 13:28:27,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-23 13:28:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 235 states have (on average 1.553191489361702) internal successors, (365), 239 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 13:28:27,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:27,413 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:27,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1944297238, now seen corresponding path program 1 times [2021-11-23 13:28:27,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028666224] [2021-11-23 13:28:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:27,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:27,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028666224] [2021-11-23 13:28:27,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028666224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:27,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:27,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:27,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101610017] [2021-11-23 13:28:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:27,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:27,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:27,915 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.553191489361702) internal successors, (365), 239 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:28,136 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2021-11-23 13:28:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 13:28:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:28,167 INFO L225 Difference]: With dead ends: 510 [2021-11-23 13:28:28,167 INFO L226 Difference]: Without dead ends: 294 [2021-11-23 13:28:28,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,178 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 312 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:28,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-23 13:28:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 273. [2021-11-23 13:28:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.4609665427509293) internal successors, (393), 272 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 393 transitions. [2021-11-23 13:28:28,264 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 393 transitions. Word has length 36 [2021-11-23 13:28:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:28,264 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 393 transitions. [2021-11-23 13:28:28,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 393 transitions. [2021-11-23 13:28:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 13:28:28,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:28,269 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:28,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:28:28,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1243564889, now seen corresponding path program 1 times [2021-11-23 13:28:28,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:28,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250226911] [2021-11-23 13:28:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:28,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:28,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:28,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250226911] [2021-11-23 13:28:28,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250226911] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:28,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:28,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:28,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012700453] [2021-11-23 13:28:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:28,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:28,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,408 INFO L87 Difference]: Start difference. First operand 273 states and 393 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:28,491 INFO L93 Difference]: Finished difference Result 442 states and 628 transitions. [2021-11-23 13:28:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 13:28:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:28,502 INFO L225 Difference]: With dead ends: 442 [2021-11-23 13:28:28,502 INFO L226 Difference]: Without dead ends: 331 [2021-11-23 13:28:28,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,506 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 60 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:28,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 623 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-23 13:28:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2021-11-23 13:28:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 322 states have (on average 1.4472049689440993) internal successors, (466), 325 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 466 transitions. [2021-11-23 13:28:28,546 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 466 transitions. Word has length 37 [2021-11-23 13:28:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:28,547 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 466 transitions. [2021-11-23 13:28:28,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 466 transitions. [2021-11-23 13:28:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 13:28:28,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:28,550 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:28,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:28:28,551 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1731016242, now seen corresponding path program 1 times [2021-11-23 13:28:28,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:28,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308911224] [2021-11-23 13:28:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:28,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:28,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:28,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308911224] [2021-11-23 13:28:28,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308911224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:28,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:28,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:28,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319570884] [2021-11-23 13:28:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:28,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:28,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,682 INFO L87 Difference]: Start difference. First operand 326 states and 466 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:28,737 INFO L93 Difference]: Finished difference Result 643 states and 902 transitions. [2021-11-23 13:28:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 13:28:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:28,743 INFO L225 Difference]: With dead ends: 643 [2021-11-23 13:28:28,743 INFO L226 Difference]: Without dead ends: 479 [2021-11-23 13:28:28,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,747 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 303 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:28,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 442 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-23 13:28:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 457. [2021-11-23 13:28:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.4172185430463575) internal successors, (642), 456 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 642 transitions. [2021-11-23 13:28:28,814 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 642 transitions. Word has length 37 [2021-11-23 13:28:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:28,814 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 642 transitions. [2021-11-23 13:28:28,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 642 transitions. [2021-11-23 13:28:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 13:28:28,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:28,820 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:28,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:28:28,821 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash -570570270, now seen corresponding path program 1 times [2021-11-23 13:28:28,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:28,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897706986] [2021-11-23 13:28:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:28,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:28,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897706986] [2021-11-23 13:28:28,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897706986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:28,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:28,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:28,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925596295] [2021-11-23 13:28:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:28,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:28,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,886 INFO L87 Difference]: Start difference. First operand 457 states and 642 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:28,922 INFO L93 Difference]: Finished difference Result 607 states and 864 transitions. [2021-11-23 13:28:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 13:28:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:28,927 INFO L225 Difference]: With dead ends: 607 [2021-11-23 13:28:28,927 INFO L226 Difference]: Without dead ends: 457 [2021-11-23 13:28:28,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:28,944 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 223 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:28,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 436 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-23 13:28:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2021-11-23 13:28:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.4150110375275937) internal successors, (641), 456 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 641 transitions. [2021-11-23 13:28:28,998 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 641 transitions. Word has length 44 [2021-11-23 13:28:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:28,998 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 641 transitions. [2021-11-23 13:28:28,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 641 transitions. [2021-11-23 13:28:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 13:28:29,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:29,004 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:29,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:28:29,004 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1274796896, now seen corresponding path program 1 times [2021-11-23 13:28:29,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034100589] [2021-11-23 13:28:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:29,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:29,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:29,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034100589] [2021-11-23 13:28:29,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034100589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:29,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:29,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:28:29,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794512960] [2021-11-23 13:28:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:29,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:29,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,058 INFO L87 Difference]: Start difference. First operand 457 states and 641 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:29,119 INFO L93 Difference]: Finished difference Result 712 states and 1016 transitions. [2021-11-23 13:28:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 13:28:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:29,126 INFO L225 Difference]: With dead ends: 712 [2021-11-23 13:28:29,126 INFO L226 Difference]: Without dead ends: 565 [2021-11-23 13:28:29,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,133 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 296 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:29,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 500 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-11-23 13:28:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2021-11-23 13:28:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 557 states have (on average 1.4236983842010773) internal successors, (793), 560 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 793 transitions. [2021-11-23 13:28:29,172 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 793 transitions. Word has length 44 [2021-11-23 13:28:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:29,173 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 793 transitions. [2021-11-23 13:28:29,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 793 transitions. [2021-11-23 13:28:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 13:28:29,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:29,176 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:29,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:28:29,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:29,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash -808513632, now seen corresponding path program 1 times [2021-11-23 13:28:29,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:29,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865070800] [2021-11-23 13:28:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:29,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:29,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865070800] [2021-11-23 13:28:29,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865070800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:29,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:29,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:28:29,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620473] [2021-11-23 13:28:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:29,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:29,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,268 INFO L87 Difference]: Start difference. First operand 561 states and 793 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:29,316 INFO L93 Difference]: Finished difference Result 811 states and 1161 transitions. [2021-11-23 13:28:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 13:28:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:29,322 INFO L225 Difference]: With dead ends: 811 [2021-11-23 13:28:29,322 INFO L226 Difference]: Without dead ends: 561 [2021-11-23 13:28:29,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,327 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:29,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-23 13:28:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2021-11-23 13:28:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 557 states have (on average 1.4093357271095153) internal successors, (785), 560 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 785 transitions. [2021-11-23 13:28:29,369 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 785 transitions. Word has length 44 [2021-11-23 13:28:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:29,369 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 785 transitions. [2021-11-23 13:28:29,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 785 transitions. [2021-11-23 13:28:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 13:28:29,382 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:29,382 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:29,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:28:29,384 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 648303456, now seen corresponding path program 1 times [2021-11-23 13:28:29,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:29,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316783794] [2021-11-23 13:28:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:29,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:29,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316783794] [2021-11-23 13:28:29,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316783794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:29,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:29,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:29,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435329219] [2021-11-23 13:28:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:29,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:29,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:29,486 INFO L87 Difference]: Start difference. First operand 561 states and 785 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:29,671 INFO L93 Difference]: Finished difference Result 1010 states and 1434 transitions. [2021-11-23 13:28:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:29,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 13:28:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:29,679 INFO L225 Difference]: With dead ends: 1010 [2021-11-23 13:28:29,679 INFO L226 Difference]: Without dead ends: 761 [2021-11-23 13:28:29,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:29,683 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 605 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:29,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [605 Valid, 610 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-11-23 13:28:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 561. [2021-11-23 13:28:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 557 states have (on average 1.4039497307001796) internal successors, (782), 560 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 782 transitions. [2021-11-23 13:28:29,733 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 782 transitions. Word has length 44 [2021-11-23 13:28:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:29,734 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 782 transitions. [2021-11-23 13:28:29,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 782 transitions. [2021-11-23 13:28:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 13:28:29,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:29,737 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:29,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:28:29,738 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1595679842, now seen corresponding path program 1 times [2021-11-23 13:28:29,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:29,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356335707] [2021-11-23 13:28:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:29,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:29,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356335707] [2021-11-23 13:28:29,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356335707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:29,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:29,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:28:29,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246386332] [2021-11-23 13:28:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:29,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:29,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,804 INFO L87 Difference]: Start difference. First operand 561 states and 782 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:29,899 INFO L93 Difference]: Finished difference Result 1007 states and 1413 transitions. [2021-11-23 13:28:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 13:28:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:29,906 INFO L225 Difference]: With dead ends: 1007 [2021-11-23 13:28:29,906 INFO L226 Difference]: Without dead ends: 761 [2021-11-23 13:28:29,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:29,909 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 276 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:29,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 478 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-11-23 13:28:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 735. [2021-11-23 13:28:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 731 states have (on average 1.3912448700410396) internal successors, (1017), 734 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1017 transitions. [2021-11-23 13:28:29,979 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1017 transitions. Word has length 44 [2021-11-23 13:28:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:29,979 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 1017 transitions. [2021-11-23 13:28:29,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1017 transitions. [2021-11-23 13:28:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 13:28:29,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:29,984 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:29,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:28:29,991 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1278461036, now seen corresponding path program 1 times [2021-11-23 13:28:29,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503742999] [2021-11-23 13:28:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:29,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:30,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503742999] [2021-11-23 13:28:30,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503742999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:30,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:30,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:30,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114155967] [2021-11-23 13:28:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:30,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:30,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:30,070 INFO L87 Difference]: Start difference. First operand 735 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:30,171 INFO L93 Difference]: Finished difference Result 1186 states and 1624 transitions. [2021-11-23 13:28:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:30,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-23 13:28:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:30,179 INFO L225 Difference]: With dead ends: 1186 [2021-11-23 13:28:30,179 INFO L226 Difference]: Without dead ends: 891 [2021-11-23 13:28:30,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:30,183 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 48 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:30,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 677 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-11-23 13:28:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2021-11-23 13:28:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 887 states have (on average 1.358511837655017) internal successors, (1205), 890 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1205 transitions. [2021-11-23 13:28:30,275 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1205 transitions. Word has length 51 [2021-11-23 13:28:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:30,279 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1205 transitions. [2021-11-23 13:28:30,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1205 transitions. [2021-11-23 13:28:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-23 13:28:30,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:30,282 INFO L514 BasicCegarLoop]: 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] [2021-11-23 13:28:30,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 13:28:30,282 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 971006567, now seen corresponding path program 1 times [2021-11-23 13:28:30,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:30,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134516164] [2021-11-23 13:28:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:30,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:30,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:30,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134516164] [2021-11-23 13:28:30,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134516164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:30,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:30,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:30,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258464463] [2021-11-23 13:28:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:30,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:30,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:30,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:30,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:30,352 INFO L87 Difference]: Start difference. First operand 891 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:30,492 INFO L93 Difference]: Finished difference Result 1364 states and 1821 transitions. [2021-11-23 13:28:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:30,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-23 13:28:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:30,501 INFO L225 Difference]: With dead ends: 1364 [2021-11-23 13:28:30,502 INFO L226 Difference]: Without dead ends: 999 [2021-11-23 13:28:30,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:30,504 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 264 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:30,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 406 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-11-23 13:28:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2021-11-23 13:28:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 995 states have (on average 1.3396984924623117) internal successors, (1333), 998 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1333 transitions. [2021-11-23 13:28:30,637 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1333 transitions. Word has length 55 [2021-11-23 13:28:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:30,637 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1333 transitions. [2021-11-23 13:28:30,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1333 transitions. [2021-11-23 13:28:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-23 13:28:30,641 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:30,641 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:30,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:28:30,642 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 510721370, now seen corresponding path program 1 times [2021-11-23 13:28:30,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:30,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770260203] [2021-11-23 13:28:30,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:30,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:30,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770260203] [2021-11-23 13:28:30,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770260203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:30,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:30,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:28:30,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120199415] [2021-11-23 13:28:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:30,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:28:30,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:28:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:30,726 INFO L87 Difference]: Start difference. First operand 999 states and 1333 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:30,927 INFO L93 Difference]: Finished difference Result 2082 states and 2737 transitions. [2021-11-23 13:28:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:28:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-23 13:28:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:30,942 INFO L225 Difference]: With dead ends: 2082 [2021-11-23 13:28:30,942 INFO L226 Difference]: Without dead ends: 1659 [2021-11-23 13:28:30,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:30,946 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 302 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:30,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 1482 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-11-23 13:28:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1023. [2021-11-23 13:28:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1019 states have (on average 1.3277723258096172) internal successors, (1353), 1022 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1353 transitions. [2021-11-23 13:28:31,055 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1353 transitions. Word has length 56 [2021-11-23 13:28:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:31,055 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1353 transitions. [2021-11-23 13:28:31,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1353 transitions. [2021-11-23 13:28:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-23 13:28:31,061 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:31,061 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:31,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 13:28:31,062 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1212321244, now seen corresponding path program 1 times [2021-11-23 13:28:31,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:31,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211355670] [2021-11-23 13:28:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:31,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:31,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211355670] [2021-11-23 13:28:31,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211355670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:31,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:31,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:28:31,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727713925] [2021-11-23 13:28:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:31,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:28:31,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:28:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:31,136 INFO L87 Difference]: Start difference. First operand 1023 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:31,353 INFO L93 Difference]: Finished difference Result 1812 states and 2363 transitions. [2021-11-23 13:28:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:28:31,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-23 13:28:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:31,364 INFO L225 Difference]: With dead ends: 1812 [2021-11-23 13:28:31,365 INFO L226 Difference]: Without dead ends: 1314 [2021-11-23 13:28:31,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:31,368 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 280 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:31,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1424 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-11-23 13:28:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 921. [2021-11-23 13:28:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 917 states have (on average 1.3326063249727371) internal successors, (1222), 920 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1222 transitions. [2021-11-23 13:28:31,476 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1222 transitions. Word has length 56 [2021-11-23 13:28:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:31,476 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1222 transitions. [2021-11-23 13:28:31,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1222 transitions. [2021-11-23 13:28:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-23 13:28:31,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:31,480 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:31,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 13:28:31,481 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1352929436, now seen corresponding path program 1 times [2021-11-23 13:28:31,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:31,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867555751] [2021-11-23 13:28:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:31,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:31,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867555751] [2021-11-23 13:28:31,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867555751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:31,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:31,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:28:31,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513303445] [2021-11-23 13:28:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:31,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:31,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:31,557 INFO L87 Difference]: Start difference. First operand 921 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:31,682 INFO L93 Difference]: Finished difference Result 971 states and 1282 transitions. [2021-11-23 13:28:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-23 13:28:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:31,693 INFO L225 Difference]: With dead ends: 971 [2021-11-23 13:28:31,693 INFO L226 Difference]: Without dead ends: 969 [2021-11-23 13:28:31,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:31,695 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 604 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:31,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 387 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-11-23 13:28:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 919. [2021-11-23 13:28:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 916 states have (on average 1.3307860262008733) internal successors, (1219), 918 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1219 transitions. [2021-11-23 13:28:31,802 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1219 transitions. Word has length 56 [2021-11-23 13:28:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:31,804 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1219 transitions. [2021-11-23 13:28:31,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1219 transitions. [2021-11-23 13:28:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 13:28:31,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:31,807 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:31,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 13:28:31,808 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1008873000, now seen corresponding path program 1 times [2021-11-23 13:28:31,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:31,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635757063] [2021-11-23 13:28:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:31,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:32,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:32,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635757063] [2021-11-23 13:28:32,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635757063] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:28:32,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401672718] [2021-11-23 13:28:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:32,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:28:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:28:32,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:28:32,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 13:28:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:32,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:28:32,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:28:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:32,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:28:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:33,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401672718] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:28:33,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:28:33,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2021-11-23 13:28:33,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928975889] [2021-11-23 13:28:33,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:28:33,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:28:33,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:28:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:33,409 INFO L87 Difference]: Start difference. First operand 919 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:33,658 INFO L93 Difference]: Finished difference Result 1604 states and 2089 transitions. [2021-11-23 13:28:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:28:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-23 13:28:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:33,671 INFO L225 Difference]: With dead ends: 1604 [2021-11-23 13:28:33,672 INFO L226 Difference]: Without dead ends: 1602 [2021-11-23 13:28:33,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:33,674 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 731 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:33,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 1244 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-11-23 13:28:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1191. [2021-11-23 13:28:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1188 states have (on average 1.3232323232323233) internal successors, (1572), 1190 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1572 transitions. [2021-11-23 13:28:33,901 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1572 transitions. Word has length 57 [2021-11-23 13:28:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:33,901 INFO L470 AbstractCegarLoop]: Abstraction has 1191 states and 1572 transitions. [2021-11-23 13:28:33,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1572 transitions. [2021-11-23 13:28:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:33,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:33,906 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:33,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 13:28:34,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 13:28:34,121 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash -687647874, now seen corresponding path program 1 times [2021-11-23 13:28:34,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:34,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176300558] [2021-11-23 13:28:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:34,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:28:34,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:34,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176300558] [2021-11-23 13:28:34,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176300558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:34,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:34,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:28:34,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210541816] [2021-11-23 13:28:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:34,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:28:34,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:28:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:34,179 INFO L87 Difference]: Start difference. First operand 1191 states and 1572 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:34,469 INFO L93 Difference]: Finished difference Result 2008 states and 2719 transitions. [2021-11-23 13:28:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:28:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:34,482 INFO L225 Difference]: With dead ends: 2008 [2021-11-23 13:28:34,482 INFO L226 Difference]: Without dead ends: 1592 [2021-11-23 13:28:34,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:34,485 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 632 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:34,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 1408 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2021-11-23 13:28:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1212. [2021-11-23 13:28:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1209 states have (on average 1.3126550868486353) internal successors, (1587), 1211 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1587 transitions. [2021-11-23 13:28:34,670 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1587 transitions. Word has length 70 [2021-11-23 13:28:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:34,671 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 1587 transitions. [2021-11-23 13:28:34,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1587 transitions. [2021-11-23 13:28:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:34,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:34,676 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:34,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:28:34,676 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2049185534, now seen corresponding path program 1 times [2021-11-23 13:28:34,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:34,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137244095] [2021-11-23 13:28:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:34,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:28:34,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:34,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137244095] [2021-11-23 13:28:34,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137244095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:34,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:34,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:34,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380729421] [2021-11-23 13:28:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:34,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:34,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:34,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:34,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:34,733 INFO L87 Difference]: Start difference. First operand 1212 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:34,989 INFO L93 Difference]: Finished difference Result 1994 states and 2662 transitions. [2021-11-23 13:28:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:35,002 INFO L225 Difference]: With dead ends: 1994 [2021-11-23 13:28:35,002 INFO L226 Difference]: Without dead ends: 1568 [2021-11-23 13:28:35,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:35,004 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 704 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:35,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 499 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2021-11-23 13:28:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1197. [2021-11-23 13:28:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1194 states have (on average 1.3006700167504188) internal successors, (1553), 1196 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1553 transitions. [2021-11-23 13:28:35,190 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1553 transitions. Word has length 70 [2021-11-23 13:28:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:35,191 INFO L470 AbstractCegarLoop]: Abstraction has 1197 states and 1553 transitions. [2021-11-23 13:28:35,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1553 transitions. [2021-11-23 13:28:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:35,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:35,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:35,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 13:28:35,197 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:35,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1348388484, now seen corresponding path program 1 times [2021-11-23 13:28:35,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:35,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614476342] [2021-11-23 13:28:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:35,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:28:35,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:35,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614476342] [2021-11-23 13:28:35,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614476342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:35,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:35,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:35,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311875781] [2021-11-23 13:28:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:35,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:35,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:35,243 INFO L87 Difference]: Start difference. First operand 1197 states and 1553 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:35,487 INFO L93 Difference]: Finished difference Result 1902 states and 2481 transitions. [2021-11-23 13:28:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:35,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:35,500 INFO L225 Difference]: With dead ends: 1902 [2021-11-23 13:28:35,500 INFO L226 Difference]: Without dead ends: 1484 [2021-11-23 13:28:35,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:35,503 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 584 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:35,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 618 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-11-23 13:28:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1289. [2021-11-23 13:28:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1286 states have (on average 1.2822706065318819) internal successors, (1649), 1288 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1649 transitions. [2021-11-23 13:28:35,679 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1649 transitions. Word has length 70 [2021-11-23 13:28:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:35,679 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 1649 transitions. [2021-11-23 13:28:35,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1649 transitions. [2021-11-23 13:28:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:35,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:35,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:35,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 13:28:35,684 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:35,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1596534978, now seen corresponding path program 1 times [2021-11-23 13:28:35,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:35,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872497175] [2021-11-23 13:28:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:35,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:35,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:35,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872497175] [2021-11-23 13:28:35,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872497175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:35,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:35,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:28:35,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418018916] [2021-11-23 13:28:35,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:35,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:28:35,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:28:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:35,732 INFO L87 Difference]: Start difference. First operand 1289 states and 1649 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:36,096 INFO L93 Difference]: Finished difference Result 2381 states and 3077 transitions. [2021-11-23 13:28:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:28:36,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:36,112 INFO L225 Difference]: With dead ends: 2381 [2021-11-23 13:28:36,112 INFO L226 Difference]: Without dead ends: 1887 [2021-11-23 13:28:36,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:28:36,115 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 464 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:36,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1282 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:28:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2021-11-23 13:28:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1310. [2021-11-23 13:28:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1307 states have (on average 1.269319051262433) internal successors, (1659), 1309 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1659 transitions. [2021-11-23 13:28:36,315 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1659 transitions. Word has length 70 [2021-11-23 13:28:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:36,316 INFO L470 AbstractCegarLoop]: Abstraction has 1310 states and 1659 transitions. [2021-11-23 13:28:36,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1659 transitions. [2021-11-23 13:28:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:36,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:36,321 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:36,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 13:28:36,322 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 8187076, now seen corresponding path program 1 times [2021-11-23 13:28:36,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955458855] [2021-11-23 13:28:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:36,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:36,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:36,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955458855] [2021-11-23 13:28:36,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955458855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:36,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:36,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:36,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976111659] [2021-11-23 13:28:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:36,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:36,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:36,383 INFO L87 Difference]: Start difference. First operand 1310 states and 1659 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:36,667 INFO L93 Difference]: Finished difference Result 2265 states and 2860 transitions. [2021-11-23 13:28:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:36,681 INFO L225 Difference]: With dead ends: 2265 [2021-11-23 13:28:36,682 INFO L226 Difference]: Without dead ends: 1764 [2021-11-23 13:28:36,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:36,684 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 214 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:36,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 498 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2021-11-23 13:28:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1760. [2021-11-23 13:28:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1757 states have (on average 1.2578258394991462) internal successors, (2210), 1759 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2210 transitions. [2021-11-23 13:28:36,908 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2210 transitions. Word has length 70 [2021-11-23 13:28:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:36,909 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2210 transitions. [2021-11-23 13:28:36,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2210 transitions. [2021-11-23 13:28:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:28:36,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:36,914 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:36,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 13:28:36,915 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -46205822, now seen corresponding path program 1 times [2021-11-23 13:28:36,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:36,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732077174] [2021-11-23 13:28:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:36,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:28:36,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:36,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732077174] [2021-11-23 13:28:36,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732077174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:36,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:36,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:36,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270982958] [2021-11-23 13:28:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:36,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:36,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:36,943 INFO L87 Difference]: Start difference. First operand 1760 states and 2210 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:37,176 INFO L93 Difference]: Finished difference Result 2672 states and 3349 transitions. [2021-11-23 13:28:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 13:28:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:37,190 INFO L225 Difference]: With dead ends: 2672 [2021-11-23 13:28:37,190 INFO L226 Difference]: Without dead ends: 1715 [2021-11-23 13:28:37,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:37,195 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 194 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:37,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 402 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2021-11-23 13:28:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1715. [2021-11-23 13:28:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1712 states have (on average 1.2605140186915889) internal successors, (2158), 1714 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2158 transitions. [2021-11-23 13:28:37,410 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2158 transitions. Word has length 70 [2021-11-23 13:28:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:37,410 INFO L470 AbstractCegarLoop]: Abstraction has 1715 states and 2158 transitions. [2021-11-23 13:28:37,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2158 transitions. [2021-11-23 13:28:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 13:28:37,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:37,415 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:37,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 13:28:37,416 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1548526770, now seen corresponding path program 1 times [2021-11-23 13:28:37,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:37,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471776] [2021-11-23 13:28:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:37,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:37,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:37,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471776] [2021-11-23 13:28:37,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:37,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:37,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:28:37,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113775078] [2021-11-23 13:28:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:37,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:37,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:37,464 INFO L87 Difference]: Start difference. First operand 1715 states and 2158 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:37,814 INFO L93 Difference]: Finished difference Result 3359 states and 4188 transitions. [2021-11-23 13:28:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-23 13:28:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:37,830 INFO L225 Difference]: With dead ends: 3359 [2021-11-23 13:28:37,831 INFO L226 Difference]: Without dead ends: 2081 [2021-11-23 13:28:37,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:28:37,835 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 474 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:37,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 604 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2021-11-23 13:28:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2081. [2021-11-23 13:28:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2078 states have (on average 1.2386910490856593) internal successors, (2574), 2080 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2574 transitions. [2021-11-23 13:28:38,143 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2574 transitions. Word has length 71 [2021-11-23 13:28:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:38,143 INFO L470 AbstractCegarLoop]: Abstraction has 2081 states and 2574 transitions. [2021-11-23 13:28:38,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2574 transitions. [2021-11-23 13:28:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-23 13:28:38,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:38,149 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:38,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 13:28:38,150 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 146635335, now seen corresponding path program 2 times [2021-11-23 13:28:38,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:38,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213076287] [2021-11-23 13:28:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:38,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:38,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:38,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213076287] [2021-11-23 13:28:38,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213076287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:38,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:38,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:38,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382408001] [2021-11-23 13:28:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:38,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:38,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:38,200 INFO L87 Difference]: Start difference. First operand 2081 states and 2574 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:38,418 INFO L93 Difference]: Finished difference Result 2588 states and 3234 transitions. [2021-11-23 13:28:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-23 13:28:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:38,429 INFO L225 Difference]: With dead ends: 2588 [2021-11-23 13:28:38,429 INFO L226 Difference]: Without dead ends: 1992 [2021-11-23 13:28:38,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:38,433 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 252 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:38,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 405 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2021-11-23 13:28:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1966. [2021-11-23 13:28:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1963 states have (on average 1.2338257768721346) internal successors, (2422), 1965 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2422 transitions. [2021-11-23 13:28:38,642 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2422 transitions. Word has length 72 [2021-11-23 13:28:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:38,642 INFO L470 AbstractCegarLoop]: Abstraction has 1966 states and 2422 transitions. [2021-11-23 13:28:38,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2422 transitions. [2021-11-23 13:28:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 13:28:38,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:38,646 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:38,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 13:28:38,647 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash 347515233, now seen corresponding path program 1 times [2021-11-23 13:28:38,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:38,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379539790] [2021-11-23 13:28:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:38,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:28:38,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379539790] [2021-11-23 13:28:38,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379539790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:38,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:38,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:38,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289436783] [2021-11-23 13:28:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:38,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:38,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:38,683 INFO L87 Difference]: Start difference. First operand 1966 states and 2422 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:38,905 INFO L93 Difference]: Finished difference Result 2620 states and 3249 transitions. [2021-11-23 13:28:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:38,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-23 13:28:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:38,927 INFO L225 Difference]: With dead ends: 2620 [2021-11-23 13:28:38,933 INFO L226 Difference]: Without dead ends: 1984 [2021-11-23 13:28:38,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:38,939 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 237 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:38,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 393 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2021-11-23 13:28:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1966. [2021-11-23 13:28:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1963 states have (on average 1.2236372898624555) internal successors, (2402), 1965 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2402 transitions. [2021-11-23 13:28:39,186 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2402 transitions. Word has length 84 [2021-11-23 13:28:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:39,187 INFO L470 AbstractCegarLoop]: Abstraction has 1966 states and 2402 transitions. [2021-11-23 13:28:39,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2402 transitions. [2021-11-23 13:28:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-23 13:28:39,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:39,192 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:39,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 13:28:39,192 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2043608408, now seen corresponding path program 1 times [2021-11-23 13:28:39,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:39,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650266845] [2021-11-23 13:28:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:39,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:28:39,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:39,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650266845] [2021-11-23 13:28:39,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650266845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:39,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:39,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:39,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930037117] [2021-11-23 13:28:39,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:39,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:39,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:39,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:39,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:39,241 INFO L87 Difference]: Start difference. First operand 1966 states and 2402 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:39,428 INFO L93 Difference]: Finished difference Result 2230 states and 2720 transitions. [2021-11-23 13:28:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-23 13:28:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:39,434 INFO L225 Difference]: With dead ends: 2230 [2021-11-23 13:28:39,435 INFO L226 Difference]: Without dead ends: 1324 [2021-11-23 13:28:39,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:39,437 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 56 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:39,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 602 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-11-23 13:28:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2021-11-23 13:28:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1322 states have (on average 1.2148260211800304) internal successors, (1606), 1323 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1606 transitions. [2021-11-23 13:28:39,590 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1606 transitions. Word has length 85 [2021-11-23 13:28:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:39,591 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1606 transitions. [2021-11-23 13:28:39,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1606 transitions. [2021-11-23 13:28:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 13:28:39,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:39,594 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:39,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 13:28:39,595 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1923705846, now seen corresponding path program 1 times [2021-11-23 13:28:39,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:39,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555326832] [2021-11-23 13:28:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:39,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:39,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555326832] [2021-11-23 13:28:39,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555326832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:39,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:39,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:28:39,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826975357] [2021-11-23 13:28:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:39,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:39,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:39,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:39,634 INFO L87 Difference]: Start difference. First operand 1324 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:39,828 INFO L93 Difference]: Finished difference Result 2974 states and 3588 transitions. [2021-11-23 13:28:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-23 13:28:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:39,834 INFO L225 Difference]: With dead ends: 2974 [2021-11-23 13:28:39,835 INFO L226 Difference]: Without dead ends: 1682 [2021-11-23 13:28:39,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:39,838 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 79 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:39,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 342 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2021-11-23 13:28:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1670. [2021-11-23 13:28:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1668 states have (on average 1.1912470023980815) internal successors, (1987), 1669 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1987 transitions. [2021-11-23 13:28:40,027 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1987 transitions. Word has length 90 [2021-11-23 13:28:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:40,028 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 1987 transitions. [2021-11-23 13:28:40,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1987 transitions. [2021-11-23 13:28:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:28:40,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:40,033 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:40,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 13:28:40,033 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1305032493, now seen corresponding path program 1 times [2021-11-23 13:28:40,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:40,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622733857] [2021-11-23 13:28:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:40,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:28:40,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:40,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622733857] [2021-11-23 13:28:40,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622733857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:40,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:40,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:40,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040370339] [2021-11-23 13:28:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:40,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:40,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:40,084 INFO L87 Difference]: Start difference. First operand 1670 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:40,337 INFO L93 Difference]: Finished difference Result 2902 states and 3495 transitions. [2021-11-23 13:28:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-23 13:28:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:40,344 INFO L225 Difference]: With dead ends: 2902 [2021-11-23 13:28:40,345 INFO L226 Difference]: Without dead ends: 1630 [2021-11-23 13:28:40,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:40,349 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 139 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:40,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 423 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2021-11-23 13:28:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1622. [2021-11-23 13:28:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1620 states have (on average 1.1648148148148147) internal successors, (1887), 1621 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1887 transitions. [2021-11-23 13:28:40,566 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1887 transitions. Word has length 104 [2021-11-23 13:28:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:40,567 INFO L470 AbstractCegarLoop]: Abstraction has 1622 states and 1887 transitions. [2021-11-23 13:28:40,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1887 transitions. [2021-11-23 13:28:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 13:28:40,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:40,571 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:40,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 13:28:40,572 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2031523179, now seen corresponding path program 1 times [2021-11-23 13:28:40,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:40,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392075207] [2021-11-23 13:28:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:40,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 13:28:40,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392075207] [2021-11-23 13:28:40,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392075207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:40,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:40,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:28:40,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453402390] [2021-11-23 13:28:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:40,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:28:40,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:28:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:40,649 INFO L87 Difference]: Start difference. First operand 1622 states and 1887 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:41,035 INFO L93 Difference]: Finished difference Result 3396 states and 3948 transitions. [2021-11-23 13:28:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:28:41,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-23 13:28:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:41,044 INFO L225 Difference]: With dead ends: 3396 [2021-11-23 13:28:41,045 INFO L226 Difference]: Without dead ends: 3394 [2021-11-23 13:28:41,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:28:41,047 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 246 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:41,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 608 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2021-11-23 13:28:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2324. [2021-11-23 13:28:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2322 states have (on average 1.1752799310938846) internal successors, (2729), 2323 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 2729 transitions. [2021-11-23 13:28:41,279 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 2729 transitions. Word has length 105 [2021-11-23 13:28:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:41,280 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 2729 transitions. [2021-11-23 13:28:41,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2729 transitions. [2021-11-23 13:28:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 13:28:41,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:41,285 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:41,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 13:28:41,285 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:41,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1166573465, now seen corresponding path program 1 times [2021-11-23 13:28:41,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:41,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127153883] [2021-11-23 13:28:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:41,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:28:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 13:28:41,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:28:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127153883] [2021-11-23 13:28:41,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127153883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:28:41,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:28:41,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:28:41,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836533964] [2021-11-23 13:28:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:28:41,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:28:41,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:28:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:28:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:41,330 INFO L87 Difference]: Start difference. First operand 2324 states and 2729 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:28:41,747 INFO L93 Difference]: Finished difference Result 5404 states and 6415 transitions. [2021-11-23 13:28:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:28:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-23 13:28:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:28:41,757 INFO L225 Difference]: With dead ends: 5404 [2021-11-23 13:28:41,758 INFO L226 Difference]: Without dead ends: 3836 [2021-11-23 13:28:41,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:28:41,762 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 140 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:28:41,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 516 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:28:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2021-11-23 13:28:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2328. [2021-11-23 13:28:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2326 states have (on average 1.1749785038693035) internal successors, (2733), 2327 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2733 transitions. [2021-11-23 13:28:42,023 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2733 transitions. Word has length 109 [2021-11-23 13:28:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:28:42,024 INFO L470 AbstractCegarLoop]: Abstraction has 2328 states and 2733 transitions. [2021-11-23 13:28:42,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:28:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2733 transitions. [2021-11-23 13:28:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 13:28:42,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:28:42,028 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:42,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 13:28:42,029 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-23 13:28:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:28:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1566602413, now seen corresponding path program 1 times [2021-11-23 13:28:42,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:28:42,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019924625] [2021-11-23 13:28:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:28:42,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:28:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:28:42,048 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 13:28:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:28:42,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 13:28:42,126 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 13:28:42,127 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-23 13:28:42,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-23 13:28:42,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-23 13:28:42,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-23 13:28:42,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 13:28:42,136 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:28:42,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:28:42,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:28:42 BoogieIcfgContainer [2021-11-23 13:28:42,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:28:42,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:28:42,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:28:42,340 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:28:42,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:27" (3/4) ... [2021-11-23 13:28:42,353 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 13:28:42,540 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:28:42,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:28:42,541 INFO L158 Benchmark]: Toolchain (without parser) took 16991.49ms. Allocated memory was 102.8MB in the beginning and 474.0MB in the end (delta: 371.2MB). Free memory was 59.8MB in the beginning and 204.4MB in the end (delta: -144.5MB). Peak memory consumption was 227.2MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,542 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 102.8MB. Free memory was 76.4MB in the beginning and 76.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:28:42,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.53ms. Allocated memory is still 102.8MB. Free memory was 59.6MB in the beginning and 71.9MB in the end (delta: -12.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.36ms. Allocated memory is still 102.8MB. Free memory was 71.9MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,543 INFO L158 Benchmark]: Boogie Preprocessor took 98.91ms. Allocated memory is still 102.8MB. Free memory was 68.2MB in the beginning and 65.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,547 INFO L158 Benchmark]: RCFGBuilder took 1004.17ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 38.8MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,548 INFO L158 Benchmark]: TraceAbstraction took 15060.34ms. Allocated memory was 102.8MB in the beginning and 474.0MB in the end (delta: 371.2MB). Free memory was 38.4MB in the beginning and 222.2MB in the end (delta: -183.8MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,548 INFO L158 Benchmark]: Witness Printer took 201.17ms. Allocated memory is still 474.0MB. Free memory was 222.2MB in the beginning and 204.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-23 13:28:42,556 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.37ms. Allocated memory is still 102.8MB. Free memory was 76.4MB in the beginning and 76.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.53ms. Allocated memory is still 102.8MB. Free memory was 59.6MB in the beginning and 71.9MB in the end (delta: -12.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.36ms. Allocated memory is still 102.8MB. Free memory was 71.9MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.91ms. Allocated memory is still 102.8MB. Free memory was 68.2MB in the beginning and 65.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.17ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 38.8MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15060.34ms. Allocated memory was 102.8MB in the beginning and 474.0MB in the end (delta: 371.2MB). Free memory was 38.4MB in the beginning and 222.2MB in the end (delta: -183.8MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. * Witness Printer took 201.17ms. Allocated memory is still 474.0MB. Free memory was 222.2MB in the beginning and 204.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 [L803] FCALL update_channels2() [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() [L641] COND FALSE !(M_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() [L806] CALL activate_threads2() [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() [L807] CALL reset_delta_events2() [L669] COND FALSE !(M_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() [L810] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] RET, EXPR exists_runnable_thread2() [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] RET, EXPR exists_runnable_thread2() [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 [L431] CALL immediate_notify() [L723] CALL activate_threads2() [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() [L431] RET immediate_notify() [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] E_M = 1 [L491] CALL immediate_notify() [L723] CALL activate_threads2() [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() [L491] RET immediate_notify() [L492] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] RET, EXPR exists_runnable_thread2() [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 [L453] CALL error2() [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 390]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 29, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9035 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9035 mSDsluCounter, 18074 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8741 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 9333 mSDtfsCounter, 540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2328occurred in iteration=28, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 5937 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 4245 SizeOfPredicates, 2 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 30 InterpolantComputations, 27 PerfectInterpolantSequences, 260/266 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! [2021-11-23 13:28:42,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a98d7653-f810-4be8-9bd4-7c86bbc38f96/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE