./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:27:31,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:27:31,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:27:32,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:27:32,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:27:32,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:27:32,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:27:32,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:27:32,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:27:32,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:27:32,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:27:32,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:27:32,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:27:32,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:27:32,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:27:32,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:27:32,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:27:32,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:27:32,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:27:32,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:27:32,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:27:32,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:27:32,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:27:32,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:27:32,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:27:32,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:27:32,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:27:32,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:27:32,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:27:32,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:27:32,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:27:32,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:27:32,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:27:32,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:27:32,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:27:32,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:27:32,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:27:32,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:27:32,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:27:32,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:27:32,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:27:32,131 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 08:27:32,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:27:32,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:27:32,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:27:32,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:27:32,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:27:32,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:27:32,203 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:27:32,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:27:32,204 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:27:32,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:27:32,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:27:32,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:27:32,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:27:32,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:27:32,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:27:32,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:27:32,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:27:32,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:27:32,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:27:32,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:27:32,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:27:32,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:27:32,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:27:32,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:27:32,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:27:32,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:27:32,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:27:32,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:27:32,212 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:27:32,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:27:32,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:27:32,215 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:27:32,215 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_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/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_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2021-11-07 08:27:32,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:27:32,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:27:32,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:27:32,608 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:27:32,609 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:27:32,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-11-07 08:27:32,691 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/data/d8f898b0b/c47edd7a79224b5f9d84d406ea3d69ba/FLAG7fe3827ef [2021-11-07 08:27:33,282 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:27:33,285 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-11-07 08:27:33,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/data/d8f898b0b/c47edd7a79224b5f9d84d406ea3d69ba/FLAG7fe3827ef [2021-11-07 08:27:33,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/data/d8f898b0b/c47edd7a79224b5f9d84d406ea3d69ba [2021-11-07 08:27:33,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:27:33,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:27:33,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:27:33,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:27:33,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:27:33,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:33" (1/1) ... [2021-11-07 08:27:33,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0adbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:33, skipping insertion in model container [2021-11-07 08:27:33,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:33" (1/1) ... [2021-11-07 08:27:33,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:27:33,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:27:33,943 WARN L228 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_37626e8a-bcec-415d-85ff-8ed2ee759543/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-11-07 08:27:34,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:27:34,036 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:27:34,051 WARN L228 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_37626e8a-bcec-415d-85ff-8ed2ee759543/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-11-07 08:27:34,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:27:34,104 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:27:34,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34 WrapperNode [2021-11-07 08:27:34,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:27:34,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:27:34,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:27:34,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:27:34,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:27:34,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:27:34,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:27:34,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:27:34,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:27:34,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:27:34,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:27:34,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:27:34,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (1/1) ... [2021-11-07 08:27:34,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:27:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:27:34,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:27:34,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:27:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:27:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:27:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:27:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:27:35,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:27:35,161 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-07 08:27:35,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:35 BoogieIcfgContainer [2021-11-07 08:27:35,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:27:35,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:27:35,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:27:35,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:27:35,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:27:33" (1/3) ... [2021-11-07 08:27:35,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3891db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:27:35, skipping insertion in model container [2021-11-07 08:27:35,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:34" (2/3) ... [2021-11-07 08:27:35,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3891db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:27:35, skipping insertion in model container [2021-11-07 08:27:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:35" (3/3) ... [2021-11-07 08:27:35,202 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-11-07 08:27:35,209 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:27:35,209 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 08:27:35,271 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:27:35,280 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-07 08:27:35,280 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 08:27:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 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-07 08:27:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:35,313 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:35,314 INFO L513 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] [2021-11-07 08:27:35,315 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:35,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-11-07 08:27:35,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:35,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348246922] [2021-11-07 08:27:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:35,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:35,559 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-07 08:27:35,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:35,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348246922] [2021-11-07 08:27:35,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348246922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:35,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:35,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:35,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578828094] [2021-11-07 08:27:35,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:35,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:35,610 INFO L87 Difference]: Start difference. First operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 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 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:35,704 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2021-11-07 08:27:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:35,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:35,728 INFO L225 Difference]: With dead ends: 291 [2021-11-07 08:27:35,728 INFO L226 Difference]: Without dead ends: 144 [2021-11-07 08:27:35,732 INFO L786 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-07 08:27:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-07 08:27:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-07 08:27:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 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-07 08:27:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2021-11-07 08:27:35,820 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2021-11-07 08:27:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:35,822 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2021-11-07 08:27:35,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2021-11-07 08:27:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:35,827 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:35,827 INFO L513 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] [2021-11-07 08:27:35,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:27:35,829 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-11-07 08:27:35,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:35,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323106282] [2021-11-07 08:27:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:35,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:35,964 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-07 08:27:35,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:35,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323106282] [2021-11-07 08:27:35,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323106282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:35,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:35,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:27:35,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246783890] [2021-11-07 08:27:35,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:35,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:35,972 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:36,074 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2021-11-07 08:27:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:36,081 INFO L225 Difference]: With dead ends: 384 [2021-11-07 08:27:36,084 INFO L226 Difference]: Without dead ends: 246 [2021-11-07 08:27:36,086 INFO L786 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-07 08:27:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-11-07 08:27:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2021-11-07 08:27:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.5083333333333333) internal successors, (362), 241 states have internal predecessors, (362), 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-07 08:27:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2021-11-07 08:27:36,150 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2021-11-07 08:27:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:36,151 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2021-11-07 08:27:36,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2021-11-07 08:27:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:36,154 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:36,154 INFO L513 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] [2021-11-07 08:27:36,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:27:36,155 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-11-07 08:27:36,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:36,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343461841] [2021-11-07 08:27:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:36,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:36,238 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-07 08:27:36,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:36,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343461841] [2021-11-07 08:27:36,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343461841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:36,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:36,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:27:36,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803213958] [2021-11-07 08:27:36,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:36,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:36,250 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:36,315 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2021-11-07 08:27:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:36,319 INFO L225 Difference]: With dead ends: 477 [2021-11-07 08:27:36,319 INFO L226 Difference]: Without dead ends: 242 [2021-11-07 08:27:36,321 INFO L786 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-07 08:27:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-07 08:27:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-07 08:27:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.475) internal successors, (354), 241 states have internal predecessors, (354), 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-07 08:27:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2021-11-07 08:27:36,369 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2021-11-07 08:27:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:36,369 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2021-11-07 08:27:36,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2021-11-07 08:27:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:36,374 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:36,374 INFO L513 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] [2021-11-07 08:27:36,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:27:36,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-11-07 08:27:36,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:36,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961689146] [2021-11-07 08:27:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:36,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:36,483 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-07 08:27:36,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:36,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961689146] [2021-11-07 08:27:36,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961689146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:36,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:36,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:27:36,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805618890] [2021-11-07 08:27:36,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:36,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:36,487 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:36,574 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2021-11-07 08:27:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:36,577 INFO L225 Difference]: With dead ends: 476 [2021-11-07 08:27:36,577 INFO L226 Difference]: Without dead ends: 242 [2021-11-07 08:27:36,579 INFO L786 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-07 08:27:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-07 08:27:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-07 08:27:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4166666666666667) internal successors, (340), 241 states have internal predecessors, (340), 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-07 08:27:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2021-11-07 08:27:36,622 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2021-11-07 08:27:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:36,623 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2021-11-07 08:27:36,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-07 08:27:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2021-11-07 08:27:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:36,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:36,626 INFO L513 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] [2021-11-07 08:27:36,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:27:36,626 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-11-07 08:27:36,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:36,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834680475] [2021-11-07 08:27:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:36,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:36,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-07 08:27:36,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:36,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834680475] [2021-11-07 08:27:36,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834680475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:36,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:36,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:36,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935579488] [2021-11-07 08:27:36,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:36,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:36,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:36,679 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:36,842 INFO L93 Difference]: Finished difference Result 634 states and 896 transitions. [2021-11-07 08:27:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:36,846 INFO L225 Difference]: With dead ends: 634 [2021-11-07 08:27:36,846 INFO L226 Difference]: Without dead ends: 401 [2021-11-07 08:27:36,847 INFO L786 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-07 08:27:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-11-07 08:27:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 242. [2021-11-07 08:27:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4041666666666666) internal successors, (337), 241 states have internal predecessors, (337), 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-07 08:27:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 337 transitions. [2021-11-07 08:27:36,884 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 337 transitions. Word has length 39 [2021-11-07 08:27:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:36,885 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 337 transitions. [2021-11-07 08:27:36,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 337 transitions. [2021-11-07 08:27:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:27:36,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:36,893 INFO L513 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] [2021-11-07 08:27:36,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:27:36,894 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-11-07 08:27:36,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:36,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682480400] [2021-11-07 08:27:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:36,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:36,987 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-07 08:27:36,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:36,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682480400] [2021-11-07 08:27:36,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682480400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:36,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:36,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:36,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931061845] [2021-11-07 08:27:36,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:36,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:36,998 INFO L87 Difference]: Start difference. First operand 242 states and 337 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:37,168 INFO L93 Difference]: Finished difference Result 820 states and 1141 transitions. [2021-11-07 08:27:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2021-11-07 08:27:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:37,177 INFO L225 Difference]: With dead ends: 820 [2021-11-07 08:27:37,177 INFO L226 Difference]: Without dead ends: 589 [2021-11-07 08:27:37,178 INFO L786 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-07 08:27:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-07 08:27:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2021-11-07 08:27:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 539 states have (on average 1.37291280148423) internal successors, (740), 540 states have internal predecessors, (740), 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-07 08:27:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 740 transitions. [2021-11-07 08:27:37,239 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 740 transitions. Word has length 39 [2021-11-07 08:27:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:37,241 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 740 transitions. [2021-11-07 08:27:37,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-07 08:27:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 740 transitions. [2021-11-07 08:27:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:37,246 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:37,246 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:37,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:27:37,247 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1134866542, now seen corresponding path program 1 times [2021-11-07 08:27:37,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:37,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665113610] [2021-11-07 08:27:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:37,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 08:27:37,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:37,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665113610] [2021-11-07 08:27:37,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665113610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:37,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:37,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:27:37,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764453967] [2021-11-07 08:27:37,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:27:37,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:27:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:37,369 INFO L87 Difference]: Start difference. First operand 541 states and 740 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-07 08:27:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:37,594 INFO L93 Difference]: Finished difference Result 1379 states and 1899 transitions. [2021-11-07 08:27:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:27:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-07 08:27:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:37,602 INFO L225 Difference]: With dead ends: 1379 [2021-11-07 08:27:37,603 INFO L226 Difference]: Without dead ends: 859 [2021-11-07 08:27:37,605 INFO L786 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-07 08:27:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-07 08:27:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2021-11-07 08:27:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 1.3428571428571427) internal successors, (752), 561 states have internal predecessors, (752), 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-07 08:27:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2021-11-07 08:27:37,676 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2021-11-07 08:27:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:37,678 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2021-11-07 08:27:37,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-07 08:27:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2021-11-07 08:27:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:37,679 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:37,680 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:37,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:27:37,680 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2021-11-07 08:27:37,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:37,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68525930] [2021-11-07 08:27:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:37,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:37,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:37,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68525930] [2021-11-07 08:27:37,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68525930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:37,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:37,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:37,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343983158] [2021-11-07 08:27:37,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:37,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:37,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:37,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:37,778 INFO L87 Difference]: Start difference. First operand 562 states and 752 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-07 08:27:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:37,924 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2021-11-07 08:27:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:37,925 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-07 08:27:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:37,933 INFO L225 Difference]: With dead ends: 1555 [2021-11-07 08:27:37,933 INFO L226 Difference]: Without dead ends: 1018 [2021-11-07 08:27:37,935 INFO L786 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-07 08:27:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-11-07 08:27:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2021-11-07 08:27:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 980 states have (on average 1.292857142857143) internal successors, (1267), 981 states have internal predecessors, (1267), 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-07 08:27:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2021-11-07 08:27:38,059 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2021-11-07 08:27:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:38,059 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2021-11-07 08:27:38,060 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-07 08:27:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2021-11-07 08:27:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 08:27:38,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:38,061 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:38,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:27:38,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2021-11-07 08:27:38,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:38,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058203449] [2021-11-07 08:27:38,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:38,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 08:27:38,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:38,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058203449] [2021-11-07 08:27:38,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058203449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:38,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:38,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:27:38,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481531795] [2021-11-07 08:27:38,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:38,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:38,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:38,173 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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-07 08:27:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:38,393 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2021-11-07 08:27:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:38,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 52 [2021-11-07 08:27:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:38,406 INFO L225 Difference]: With dead ends: 2328 [2021-11-07 08:27:38,406 INFO L226 Difference]: Without dead ends: 1624 [2021-11-07 08:27:38,408 INFO L786 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-07 08:27:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-11-07 08:27:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2021-11-07 08:27:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1332 states have (on average 1.2905405405405406) internal successors, (1719), 1333 states have internal predecessors, (1719), 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-07 08:27:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2021-11-07 08:27:38,567 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2021-11-07 08:27:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:38,568 INFO L470 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2021-11-07 08:27:38,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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-07 08:27:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2021-11-07 08:27:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 08:27:38,570 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:38,571 INFO L513 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] [2021-11-07 08:27:38,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:27:38,571 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:38,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2021-11-07 08:27:38,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:38,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445855759] [2021-11-07 08:27:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:38,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:38,624 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-07 08:27:38,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:38,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445855759] [2021-11-07 08:27:38,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445855759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:38,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:38,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:27:38,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392687630] [2021-11-07 08:27:38,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:27:38,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:27:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:38,628 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-07 08:27:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:38,896 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2021-11-07 08:27:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:27:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2021-11-07 08:27:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:38,908 INFO L225 Difference]: With dead ends: 2606 [2021-11-07 08:27:38,908 INFO L226 Difference]: Without dead ends: 1600 [2021-11-07 08:27:38,911 INFO L786 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-07 08:27:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-11-07 08:27:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2021-11-07 08:27:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1344 states have (on average 1.2626488095238095) internal successors, (1697), 1345 states have internal predecessors, (1697), 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-07 08:27:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2021-11-07 08:27:39,078 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2021-11-07 08:27:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:39,079 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2021-11-07 08:27:39,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-07 08:27:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2021-11-07 08:27:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 08:27:39,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:39,081 INFO L513 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] [2021-11-07 08:27:39,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:27:39,082 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2021-11-07 08:27:39,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:39,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932523006] [2021-11-07 08:27:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:39,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:39,175 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-07 08:27:39,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:39,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932523006] [2021-11-07 08:27:39,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932523006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:39,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:39,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:39,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637972470] [2021-11-07 08:27:39,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:39,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:39,180 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-07 08:27:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:39,478 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2021-11-07 08:27:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2021-11-07 08:27:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:39,500 INFO L225 Difference]: With dead ends: 3754 [2021-11-07 08:27:39,500 INFO L226 Difference]: Without dead ends: 2454 [2021-11-07 08:27:39,506 INFO L786 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-07 08:27:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-11-07 08:27:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2021-11-07 08:27:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2424 states have (on average 1.2421617161716172) internal successors, (3011), 2425 states have internal predecessors, (3011), 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-07 08:27:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2021-11-07 08:27:39,816 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2021-11-07 08:27:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:39,817 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2021-11-07 08:27:39,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-07 08:27:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2021-11-07 08:27:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 08:27:39,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:39,820 INFO L513 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] [2021-11-07 08:27:39,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:27:39,820 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2021-11-07 08:27:39,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:39,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522422959] [2021-11-07 08:27:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:39,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:39,887 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-07 08:27:39,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:39,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522422959] [2021-11-07 08:27:39,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522422959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:39,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:39,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:39,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119100881] [2021-11-07 08:27:39,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:39,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:39,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:39,895 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07 08:27:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:40,220 INFO L93 Difference]: Finished difference Result 4272 states and 5305 transitions. [2021-11-07 08:27:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:27:40,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2021-11-07 08:27:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:40,234 INFO L225 Difference]: With dead ends: 4272 [2021-11-07 08:27:40,234 INFO L226 Difference]: Without dead ends: 1871 [2021-11-07 08:27:40,238 INFO L786 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-07 08:27:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-11-07 08:27:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2021-11-07 08:27:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1869 states have (on average 1.2241840556447299) internal successors, (2288), 1870 states have internal predecessors, (2288), 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-07 08:27:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2021-11-07 08:27:40,449 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2021-11-07 08:27:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:40,450 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2021-11-07 08:27:40,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07 08:27:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2021-11-07 08:27:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 08:27:40,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:40,453 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:40,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:27:40,454 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2021-11-07 08:27:40,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:40,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566118905] [2021-11-07 08:27:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:40,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 08:27:40,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:40,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566118905] [2021-11-07 08:27:40,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566118905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:40,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:40,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:40,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076293887] [2021-11-07 08:27:40,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:40,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:40,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:40,501 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-07 08:27:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:40,770 INFO L93 Difference]: Finished difference Result 3739 states and 4570 transitions. [2021-11-07 08:27:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:27:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 94 [2021-11-07 08:27:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:40,782 INFO L225 Difference]: With dead ends: 3739 [2021-11-07 08:27:40,782 INFO L226 Difference]: Without dead ends: 1626 [2021-11-07 08:27:40,786 INFO L786 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-07 08:27:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2021-11-07 08:27:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1596. [2021-11-07 08:27:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.213927227101631) internal successors, (1935), 1595 states have internal predecessors, (1935), 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-07 08:27:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2021-11-07 08:27:40,945 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2021-11-07 08:27:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:40,945 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2021-11-07 08:27:40,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-07 08:27:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2021-11-07 08:27:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 08:27:40,948 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:40,948 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:27:40,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:27:40,949 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2021-11-07 08:27:40,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:40,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723832757] [2021-11-07 08:27:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:40,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 08:27:41,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:41,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723832757] [2021-11-07 08:27:41,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723832757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:41,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:41,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:41,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642224149] [2021-11-07 08:27:41,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:41,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:41,033 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-07 08:27:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:41,232 INFO L93 Difference]: Finished difference Result 2602 states and 3124 transitions. [2021-11-07 08:27:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:27:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2021-11-07 08:27:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:41,238 INFO L225 Difference]: With dead ends: 2602 [2021-11-07 08:27:41,239 INFO L226 Difference]: Without dead ends: 716 [2021-11-07 08:27:41,244 INFO L786 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-07 08:27:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-11-07 08:27:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-11-07 08:27:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 714 states have (on average 1.1288515406162465) internal successors, (806), 715 states have internal predecessors, (806), 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-07 08:27:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2021-11-07 08:27:41,344 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2021-11-07 08:27:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:41,345 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2021-11-07 08:27:41,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-07 08:27:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2021-11-07 08:27:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 08:27:41,347 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:41,347 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:27:41,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:27:41,348 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2021-11-07 08:27:41,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:41,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73237625] [2021-11-07 08:27:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:41,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:41,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:41,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73237625] [2021-11-07 08:27:41,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73237625] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:41,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:41,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:41,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885262513] [2021-11-07 08:27:41,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:41,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:41,424 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-07 08:27:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:41,526 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2021-11-07 08:27:41,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:41,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2021-11-07 08:27:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:41,531 INFO L225 Difference]: With dead ends: 1048 [2021-11-07 08:27:41,531 INFO L226 Difference]: Without dead ends: 594 [2021-11-07 08:27:41,534 INFO L786 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-07 08:27:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-07 08:27:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-11-07 08:27:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 592 states have (on average 1.1182432432432432) internal successors, (662), 593 states have internal predecessors, (662), 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-07 08:27:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2021-11-07 08:27:41,598 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2021-11-07 08:27:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:41,598 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2021-11-07 08:27:41,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-07 08:27:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2021-11-07 08:27:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-07 08:27:41,600 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:41,601 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:27:41,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:27:41,601 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2021-11-07 08:27:41,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:41,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976800185] [2021-11-07 08:27:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:41,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 08:27:41,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:41,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976800185] [2021-11-07 08:27:41,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976800185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:41,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:41,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:41,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455854638] [2021-11-07 08:27:41,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:41,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:41,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:41,738 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07 08:27:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:41,831 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2021-11-07 08:27:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 95 [2021-11-07 08:27:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:41,836 INFO L225 Difference]: With dead ends: 598 [2021-11-07 08:27:41,836 INFO L226 Difference]: Without dead ends: 596 [2021-11-07 08:27:41,837 INFO L786 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-07 08:27:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-07 08:27:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2021-11-07 08:27:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.1150592216582065) internal successors, (659), 591 states have internal predecessors, (659), 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-07 08:27:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2021-11-07 08:27:41,915 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2021-11-07 08:27:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:41,916 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2021-11-07 08:27:41,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07 08:27:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2021-11-07 08:27:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-07 08:27:41,918 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:41,919 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:27:41,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:27:41,919 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2021-11-07 08:27:41,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:41,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989060752] [2021-11-07 08:27:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:41,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-07 08:27:41,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:41,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989060752] [2021-11-07 08:27:41,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989060752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:41,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:41,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:27:41,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076317629] [2021-11-07 08:27:41,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:27:41,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:27:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:27:41,964 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-07 08:27:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:42,090 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2021-11-07 08:27:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:27:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 99 [2021-11-07 08:27:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:42,097 INFO L225 Difference]: With dead ends: 1230 [2021-11-07 08:27:42,097 INFO L226 Difference]: Without dead ends: 900 [2021-11-07 08:27:42,098 INFO L786 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-07 08:27:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-11-07 08:27:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2021-11-07 08:27:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.1146711635750421) internal successors, (661), 593 states have internal predecessors, (661), 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-07 08:27:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2021-11-07 08:27:42,183 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2021-11-07 08:27:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:42,184 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2021-11-07 08:27:42,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-07 08:27:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2021-11-07 08:27:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-07 08:27:42,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:42,187 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:27:42,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:27:42,187 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2021-11-07 08:27:42,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:42,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593777878] [2021-11-07 08:27:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:42,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:27:42,208 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:27:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:27:42,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:27:42,277 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:27:42,278 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:27:42,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:27:42,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:27:42,285 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:42,290 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:27:42,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:27:42 BoogieIcfgContainer [2021-11-07 08:27:42,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:27:42,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:27:42,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:27:42,453 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:27:42,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:35" (3/4) ... [2021-11-07 08:27:42,456 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 08:27:42,584 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:27:42,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:27:42,586 INFO L168 Benchmark]: Toolchain (without parser) took 8983.91 ms. Allocated memory was 92.3 MB in the beginning and 243.3 MB in the end (delta: 151.0 MB). Free memory was 55.8 MB in the beginning and 83.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,587 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 92.3 MB. Free memory is still 72.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:27:42,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.55 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 55.6 MB in the beginning and 86.7 MB in the end (delta: -31.2 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 113.2 MB. Free memory was 86.7 MB in the beginning and 84.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,589 INFO L168 Benchmark]: Boogie Preprocessor took 50.82 ms. Allocated memory is still 113.2 MB. Free memory was 84.0 MB in the beginning and 82.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,590 INFO L168 Benchmark]: RCFGBuilder took 940.69 ms. Allocated memory is still 113.2 MB. Free memory was 81.9 MB in the beginning and 62.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,590 INFO L168 Benchmark]: TraceAbstraction took 7259.67 ms. Allocated memory was 113.2 MB in the beginning and 243.3 MB in the end (delta: 130.0 MB). Free memory was 90.0 MB in the beginning and 97.5 MB in the end (delta: -7.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,591 INFO L168 Benchmark]: Witness Printer took 131.86 ms. Allocated memory is still 243.3 MB. Free memory was 97.5 MB in the beginning and 83.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 08:27:42,595 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.37 ms. Allocated memory is still 92.3 MB. Free memory is still 72.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 498.55 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 55.6 MB in the beginning and 86.7 MB in the end (delta: -31.2 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 113.2 MB. Free memory was 86.7 MB in the beginning and 84.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.82 ms. Allocated memory is still 113.2 MB. Free memory was 84.0 MB in the beginning and 82.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 940.69 ms. Allocated memory is still 113.2 MB. Free memory was 81.9 MB in the beginning and 62.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7259.67 ms. Allocated memory was 113.2 MB in the beginning and 243.3 MB in the end (delta: 130.0 MB). Free memory was 90.0 MB in the beginning and 97.5 MB in the end (delta: -7.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 16.1 GB. * Witness Printer took 131.86 ms. Allocated memory is still 243.3 MB. Free memory was 97.5 MB in the beginning and 83.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L152] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L152] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L167] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L119] token += 1 [L120] E_M = 1 [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L136] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L152] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L156] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L165] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L167] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L122] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L213] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L69] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L20] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 20]: 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, 148 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3652 SDtfs, 4277 SDslu, 2959 SDs, 0 SdLazy, 416 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1154 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 197/197 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-07 08:27:42,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37626e8a-bcec-415d-85ff-8ed2ee759543/bin/uautomizer-AkOaLMaTGY/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