./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg --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 baf2862afdca861ecfab5536f844964e557a2feed6de3725a6fb79b602497014 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:26:38,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:26:38,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:26:38,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:26:38,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:26:38,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:26:38,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:26:38,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:26:38,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:26:38,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:26:38,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:26:38,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:26:38,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:26:38,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:26:38,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:26:38,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:26:38,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:26:38,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:26:38,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:26:38,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:26:38,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:26:38,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:26:38,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:26:38,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:26:38,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:26:38,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:26:38,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:26:38,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:26:38,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:26:38,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:26:38,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:26:38,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:26:38,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:26:38,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:26:38,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:26:38,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:26:38,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:26:38,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:26:38,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:26:38,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:26:38,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:26:38,803 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:26:38,849 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:26:38,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:26:38,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:26:38,850 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:26:38,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:26:38,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:26:38,858 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:26:38,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:26:38,859 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:26:38,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:26:38,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:26:38,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:26:38,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:26:38,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:26:38,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:26:38,861 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:26:38,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:26:38,861 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:26:38,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:26:38,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:26:38,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:26:38,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:26:38,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:26:38,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:26:38,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:26:38,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:26:38,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:26:38,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:26:38,864 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:26:38,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:26:38,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:26:38,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:26:38,867 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_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/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_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg 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 -> baf2862afdca861ecfab5536f844964e557a2feed6de3725a6fb79b602497014 [2021-10-28 09:26:39,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:26:39,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:26:39,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:26:39,138 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:26:39,139 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:26:39,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-10-28 09:26:39,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/data/587fc576c/a466922291f14195a82e5d276b3da25a/FLAGf94faecf8 [2021-10-28 09:26:39,669 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:26:39,669 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-10-28 09:26:39,677 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/data/587fc576c/a466922291f14195a82e5d276b3da25a/FLAGf94faecf8 [2021-10-28 09:26:40,028 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/data/587fc576c/a466922291f14195a82e5d276b3da25a [2021-10-28 09:26:40,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:26:40,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:26:40,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:26:40,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:26:40,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:26:40,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321809e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40, skipping insertion in model container [2021-10-28 09:26:40,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:26:40,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:26:40,275 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_72cf638e-9b78-4c2c-ad15-4a7d321087ff/sv-benchmarks/c/systemc/transmitter.02.cil.c[401,414] [2021-10-28 09:26:40,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:26:40,343 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:26:40,352 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_72cf638e-9b78-4c2c-ad15-4a7d321087ff/sv-benchmarks/c/systemc/transmitter.02.cil.c[401,414] [2021-10-28 09:26:40,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:26:40,393 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:26:40,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40 WrapperNode [2021-10-28 09:26:40,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:26:40,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:26:40,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:26:40,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:26:40,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:26:40,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:26:40,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:26:40,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:26:40,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:26:40,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:26:40,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:26:40,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:26:40,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (1/1) ... [2021-10-28 09:26:40,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:26:40,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:26:40,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:26:40,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:26:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:26:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:26:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:26:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:26:41,189 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:26:41,190 INFO L299 CfgBuilder]: Removed 94 assume(true) statements. [2021-10-28 09:26:41,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:26:41 BoogieIcfgContainer [2021-10-28 09:26:41,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:26:41,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:26:41,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:26:41,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:26:41,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:26:40" (1/3) ... [2021-10-28 09:26:41,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c83fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:26:41, skipping insertion in model container [2021-10-28 09:26:41,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:26:40" (2/3) ... [2021-10-28 09:26:41,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c83fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:26:41, skipping insertion in model container [2021-10-28 09:26:41,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:26:41" (3/3) ... [2021-10-28 09:26:41,200 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-10-28 09:26:41,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:26:41,205 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:26:41,251 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:26:41,256 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-10-28 09:26:41,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 09:26:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 190 states have (on average 1.5842105263157895) internal successors, (301), 191 states have internal predecessors, (301), 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-10-28 09:26:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:41,283 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:41,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:41,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2021-10-28 09:26:41,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:41,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486677517] [2021-10-28 09:26:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:41,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:41,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:41,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486677517] [2021-10-28 09:26:41,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486677517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:41,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:41,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:41,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907084348] [2021-10-28 09:26:41,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:41,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:41,538 INFO L87 Difference]: Start difference. First operand has 192 states, 190 states have (on average 1.5842105263157895) internal successors, (301), 191 states have internal predecessors, (301), 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 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-28 09:26:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:41,620 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2021-10-28 09:26:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:41,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:41,650 INFO L225 Difference]: With dead ends: 379 [2021-10-28 09:26:41,652 INFO L226 Difference]: Without dead ends: 188 [2021-10-28 09:26:41,656 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-10-28 09:26:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-10-28 09:26:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-10-28 09:26:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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-10-28 09:26:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2021-10-28 09:26:41,721 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2021-10-28 09:26:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:41,723 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2021-10-28 09:26:41,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-28 09:26:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2021-10-28 09:26:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:41,727 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:41,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:41,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:26:41,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2021-10-28 09:26:41,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:41,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980592106] [2021-10-28 09:26:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:41,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:41,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:41,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980592106] [2021-10-28 09:26:41,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980592106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:41,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:41,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:41,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310345743] [2021-10-28 09:26:41,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:41,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:41,803 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:41,895 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2021-10-28 09:26:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:41,899 INFO L225 Difference]: With dead ends: 498 [2021-10-28 09:26:41,899 INFO L226 Difference]: Without dead ends: 317 [2021-10-28 09:26:41,901 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-10-28 09:26:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-28 09:26:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2021-10-28 09:26:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4872611464968153) internal successors, (467), 314 states have internal predecessors, (467), 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-10-28 09:26:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2021-10-28 09:26:41,937 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2021-10-28 09:26:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:41,937 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2021-10-28 09:26:41,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2021-10-28 09:26:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:41,940 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:41,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:41,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:26:41,940 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2021-10-28 09:26:41,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:41,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929555717] [2021-10-28 09:26:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:41,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929555717] [2021-10-28 09:26:42,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929555717] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:42,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525014483] [2021-10-28 09:26:42,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:42,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:42,015 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:42,051 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2021-10-28 09:26:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:42,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:42,055 INFO L225 Difference]: With dead ends: 622 [2021-10-28 09:26:42,055 INFO L226 Difference]: Without dead ends: 315 [2021-10-28 09:26:42,057 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-10-28 09:26:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-28 09:26:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-10-28 09:26:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4617834394904459) internal successors, (459), 314 states have internal predecessors, (459), 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-10-28 09:26:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2021-10-28 09:26:42,090 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2021-10-28 09:26:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:42,091 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2021-10-28 09:26:42,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2021-10-28 09:26:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:42,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:42,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:42,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:26:42,094 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2021-10-28 09:26:42,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:42,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433962630] [2021-10-28 09:26:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:42,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433962630] [2021-10-28 09:26:42,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433962630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:42,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264041424] [2021-10-28 09:26:42,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:42,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:42,168 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:42,216 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2021-10-28 09:26:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:42,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:42,219 INFO L225 Difference]: With dead ends: 621 [2021-10-28 09:26:42,219 INFO L226 Difference]: Without dead ends: 315 [2021-10-28 09:26:42,221 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-10-28 09:26:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-28 09:26:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-10-28 09:26:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4363057324840764) internal successors, (451), 314 states have internal predecessors, (451), 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-10-28 09:26:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2021-10-28 09:26:42,267 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2021-10-28 09:26:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:42,267 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2021-10-28 09:26:42,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2021-10-28 09:26:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:42,269 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:42,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:42,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:26:42,270 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2021-10-28 09:26:42,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:42,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963808401] [2021-10-28 09:26:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:42,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963808401] [2021-10-28 09:26:42,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963808401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:42,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436442272] [2021-10-28 09:26:42,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:42,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:42,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:42,335 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:42,433 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2021-10-28 09:26:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:42,441 INFO L225 Difference]: With dead ends: 620 [2021-10-28 09:26:42,441 INFO L226 Difference]: Without dead ends: 315 [2021-10-28 09:26:42,442 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-10-28 09:26:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-28 09:26:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-10-28 09:26:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.39171974522293) internal successors, (437), 314 states have internal predecessors, (437), 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-10-28 09:26:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2021-10-28 09:26:42,463 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2021-10-28 09:26:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:42,464 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2021-10-28 09:26:42,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2021-10-28 09:26:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:42,465 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:42,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:42,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:26:42,466 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2021-10-28 09:26:42,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:42,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135231388] [2021-10-28 09:26:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:42,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135231388] [2021-10-28 09:26:42,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135231388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:42,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486130237] [2021-10-28 09:26:42,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:42,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:42,507 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:42,547 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2021-10-28 09:26:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:42,550 INFO L225 Difference]: With dead ends: 619 [2021-10-28 09:26:42,550 INFO L226 Difference]: Without dead ends: 315 [2021-10-28 09:26:42,551 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-10-28 09:26:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-28 09:26:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-10-28 09:26:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.3471337579617835) internal successors, (423), 314 states have internal predecessors, (423), 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-10-28 09:26:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2021-10-28 09:26:42,570 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2021-10-28 09:26:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:42,571 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2021-10-28 09:26:42,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10-28 09:26:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2021-10-28 09:26:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:42,572 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:42,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:42,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:26:42,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2021-10-28 09:26:42,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:42,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423550695] [2021-10-28 09:26:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:42,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423550695] [2021-10-28 09:26:42,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423550695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:26:42,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079297503] [2021-10-28 09:26:42,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:26:42,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:26:42,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:26:42,665 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:42,808 INFO L93 Difference]: Finished difference Result 1006 states and 1358 transitions. [2021-10-28 09:26:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:26:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:42,813 INFO L225 Difference]: With dead ends: 1006 [2021-10-28 09:26:42,813 INFO L226 Difference]: Without dead ends: 709 [2021-10-28 09:26:42,814 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-10-28 09:26:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-10-28 09:26:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 327. [2021-10-28 09:26:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.322085889570552) internal successors, (431), 326 states have internal predecessors, (431), 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-10-28 09:26:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2021-10-28 09:26:42,843 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 49 [2021-10-28 09:26:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:42,845 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2021-10-28 09:26:42,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2021-10-28 09:26:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:42,848 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:42,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:42,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:26:42,849 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 145495590, now seen corresponding path program 1 times [2021-10-28 09:26:42,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:42,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605403279] [2021-10-28 09:26:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:42,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:42,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:42,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605403279] [2021-10-28 09:26:42,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605403279] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:42,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:42,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:26:42,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881032460] [2021-10-28 09:26:42,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:26:42,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:26:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:26:42,941 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:43,055 INFO L93 Difference]: Finished difference Result 870 states and 1159 transitions. [2021-10-28 09:26:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:26:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:43,059 INFO L225 Difference]: With dead ends: 870 [2021-10-28 09:26:43,060 INFO L226 Difference]: Without dead ends: 568 [2021-10-28 09:26:43,060 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-10-28 09:26:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-28 09:26:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 333. [2021-10-28 09:26:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.2981927710843373) internal successors, (431), 332 states have internal predecessors, (431), 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-10-28 09:26:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2021-10-28 09:26:43,101 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 49 [2021-10-28 09:26:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:43,102 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2021-10-28 09:26:43,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2021-10-28 09:26:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:43,103 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:43,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:26:43,104 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2068723624, now seen corresponding path program 1 times [2021-10-28 09:26:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:43,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187332578] [2021-10-28 09:26:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:43,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:43,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:43,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187332578] [2021-10-28 09:26:43,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187332578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:43,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:43,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:26:43,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556188868] [2021-10-28 09:26:43,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:26:43,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:26:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:26:43,149 INFO L87 Difference]: Start difference. First operand 333 states and 431 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:43,288 INFO L93 Difference]: Finished difference Result 895 states and 1173 transitions. [2021-10-28 09:26:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:26:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:43,293 INFO L225 Difference]: With dead ends: 895 [2021-10-28 09:26:43,293 INFO L226 Difference]: Without dead ends: 594 [2021-10-28 09:26:43,295 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-10-28 09:26:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-28 09:26:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 339. [2021-10-28 09:26:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.2751479289940828) internal successors, (431), 338 states have internal predecessors, (431), 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-10-28 09:26:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2021-10-28 09:26:43,335 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 49 [2021-10-28 09:26:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:43,335 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2021-10-28 09:26:43,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-28 09:26:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2021-10-28 09:26:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:26:43,337 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:43,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:43,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:26:43,338 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1803541846, now seen corresponding path program 1 times [2021-10-28 09:26:43,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:43,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094074711] [2021-10-28 09:26:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:43,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:43,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:43,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094074711] [2021-10-28 09:26:43,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094074711] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:43,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:43,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:43,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938629201] [2021-10-28 09:26:43,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:43,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:43,414 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-28 09:26:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:43,505 INFO L93 Difference]: Finished difference Result 919 states and 1163 transitions. [2021-10-28 09:26:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2021-10-28 09:26:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:43,509 INFO L225 Difference]: With dead ends: 919 [2021-10-28 09:26:43,510 INFO L226 Difference]: Without dead ends: 617 [2021-10-28 09:26:43,510 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-10-28 09:26:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-10-28 09:26:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 595. [2021-10-28 09:26:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.2474747474747474) internal successors, (741), 594 states have internal predecessors, (741), 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-10-28 09:26:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 741 transitions. [2021-10-28 09:26:43,573 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 741 transitions. Word has length 49 [2021-10-28 09:26:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:43,573 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 741 transitions. [2021-10-28 09:26:43,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-28 09:26:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 741 transitions. [2021-10-28 09:26:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:26:43,575 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:43,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:43,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:26:43,576 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1362638081, now seen corresponding path program 1 times [2021-10-28 09:26:43,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:43,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040599815] [2021-10-28 09:26:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:43,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:43,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:43,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040599815] [2021-10-28 09:26:43,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040599815] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:43,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:43,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:43,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557446911] [2021-10-28 09:26:43,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:43,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:43,648 INFO L87 Difference]: Start difference. First operand 595 states and 741 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-10-28 09:26:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:43,777 INFO L93 Difference]: Finished difference Result 1513 states and 1891 transitions. [2021-10-28 09:26:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-10-28 09:26:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:43,784 INFO L225 Difference]: With dead ends: 1513 [2021-10-28 09:26:43,784 INFO L226 Difference]: Without dead ends: 988 [2021-10-28 09:26:43,785 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-10-28 09:26:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-10-28 09:26:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2021-10-28 09:26:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.2365482233502538) internal successors, (1218), 985 states have internal predecessors, (1218), 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-10-28 09:26:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1218 transitions. [2021-10-28 09:26:43,879 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1218 transitions. Word has length 50 [2021-10-28 09:26:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:43,879 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 1218 transitions. [2021-10-28 09:26:43,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-10-28 09:26:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1218 transitions. [2021-10-28 09:26:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:26:43,880 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:43,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:43,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:26:43,881 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -497328611, now seen corresponding path program 1 times [2021-10-28 09:26:43,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:43,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027739491] [2021-10-28 09:26:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:43,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:43,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:43,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027739491] [2021-10-28 09:26:43,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027739491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:43,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:43,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:43,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975164300] [2021-10-28 09:26:43,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:43,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:43,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:43,913 INFO L87 Difference]: Start difference. First operand 986 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-10-28 09:26:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:44,105 INFO L93 Difference]: Finished difference Result 2794 states and 3457 transitions. [2021-10-28 09:26:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-10-28 09:26:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:44,116 INFO L225 Difference]: With dead ends: 2794 [2021-10-28 09:26:44,117 INFO L226 Difference]: Without dead ends: 1858 [2021-10-28 09:26:44,120 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-10-28 09:26:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2021-10-28 09:26:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1842. [2021-10-28 09:26:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.2232482346550788) internal successors, (2252), 1841 states have internal predecessors, (2252), 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-10-28 09:26:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2252 transitions. [2021-10-28 09:26:44,322 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2252 transitions. Word has length 51 [2021-10-28 09:26:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:44,323 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2252 transitions. [2021-10-28 09:26:44,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-10-28 09:26:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2252 transitions. [2021-10-28 09:26:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-28 09:26:44,325 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:44,325 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:44,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:26:44,326 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash -798137423, now seen corresponding path program 1 times [2021-10-28 09:26:44,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:44,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032131781] [2021-10-28 09:26:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:44,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:44,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:44,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032131781] [2021-10-28 09:26:44,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032131781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:44,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:44,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:44,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531983675] [2021-10-28 09:26:44,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:44,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:44,361 INFO L87 Difference]: Start difference. First operand 1842 states and 2252 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-28 09:26:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:44,678 INFO L93 Difference]: Finished difference Result 5392 states and 6581 transitions. [2021-10-28 09:26:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2021-10-28 09:26:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:44,694 INFO L225 Difference]: With dead ends: 5392 [2021-10-28 09:26:44,694 INFO L226 Difference]: Without dead ends: 2716 [2021-10-28 09:26:44,698 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-10-28 09:26:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2021-10-28 09:26:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2021-10-28 09:26:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.2191528545119705) internal successors, (3310), 2715 states have internal predecessors, (3310), 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-10-28 09:26:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3310 transitions. [2021-10-28 09:26:44,929 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3310 transitions. Word has length 66 [2021-10-28 09:26:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:44,930 INFO L470 AbstractCegarLoop]: Abstraction has 2716 states and 3310 transitions. [2021-10-28 09:26:44,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-28 09:26:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3310 transitions. [2021-10-28 09:26:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-28 09:26:44,932 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:44,933 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:44,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:26:44,933 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 280255658, now seen corresponding path program 1 times [2021-10-28 09:26:44,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:44,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747571347] [2021-10-28 09:26:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:44,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-28 09:26:44,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:44,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747571347] [2021-10-28 09:26:44,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747571347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:44,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:44,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:26:44,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867383572] [2021-10-28 09:26:44,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:44,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:44,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:44,985 INFO L87 Difference]: Start difference. First operand 2716 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 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-10-28 09:26:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:45,256 INFO L93 Difference]: Finished difference Result 6156 states and 7487 transitions. [2021-10-28 09:26:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 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 89 [2021-10-28 09:26:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:45,276 INFO L225 Difference]: With dead ends: 6156 [2021-10-28 09:26:45,277 INFO L226 Difference]: Without dead ends: 3476 [2021-10-28 09:26:45,281 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-10-28 09:26:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2021-10-28 09:26:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3452. [2021-10-28 09:26:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.2077658649666763) internal successors, (4168), 3451 states have internal predecessors, (4168), 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-10-28 09:26:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4168 transitions. [2021-10-28 09:26:45,594 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4168 transitions. Word has length 89 [2021-10-28 09:26:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:45,595 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 4168 transitions. [2021-10-28 09:26:45,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 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-10-28 09:26:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4168 transitions. [2021-10-28 09:26:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-28 09:26:45,598 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:45,598 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:45,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:26:45,599 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2021-10-28 09:26:45,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:45,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260681085] [2021-10-28 09:26:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:45,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:45,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:45,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260681085] [2021-10-28 09:26:45,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260681085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:45,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:45,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:45,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761098698] [2021-10-28 09:26:45,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:45,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:45,632 INFO L87 Difference]: Start difference. First operand 3452 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-10-28 09:26:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:45,889 INFO L93 Difference]: Finished difference Result 6102 states and 7406 transitions. [2021-10-28 09:26:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2021-10-28 09:26:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:45,909 INFO L225 Difference]: With dead ends: 6102 [2021-10-28 09:26:45,909 INFO L226 Difference]: Without dead ends: 3454 [2021-10-28 09:26:45,914 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-10-28 09:26:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2021-10-28 09:26:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2021-10-28 09:26:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.1990727325412924) internal successors, (4138), 3451 states have internal predecessors, (4138), 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-10-28 09:26:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4138 transitions. [2021-10-28 09:26:46,185 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4138 transitions. Word has length 92 [2021-10-28 09:26:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:46,185 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 4138 transitions. [2021-10-28 09:26:46,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-10-28 09:26:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4138 transitions. [2021-10-28 09:26:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-28 09:26:46,189 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:46,189 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:26:46,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:26:46,190 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1737719815, now seen corresponding path program 1 times [2021-10-28 09:26:46,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:46,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855009974] [2021-10-28 09:26:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:46,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:46,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:46,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855009974] [2021-10-28 09:26:46,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855009974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:46,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:46,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:46,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829290316] [2021-10-28 09:26:46,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:46,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:46,228 INFO L87 Difference]: Start difference. First operand 3452 states and 4138 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10-28 09:26:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:46,476 INFO L93 Difference]: Finished difference Result 5607 states and 6744 transitions. [2021-10-28 09:26:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:46,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2021-10-28 09:26:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:46,495 INFO L225 Difference]: With dead ends: 5607 [2021-10-28 09:26:46,495 INFO L226 Difference]: Without dead ends: 3452 [2021-10-28 09:26:46,499 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-10-28 09:26:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2021-10-28 09:26:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3438. [2021-10-28 09:26:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.1812627291242364) internal successors, (4060), 3437 states have internal predecessors, (4060), 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-10-28 09:26:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4060 transitions. [2021-10-28 09:26:46,777 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4060 transitions. Word has length 115 [2021-10-28 09:26:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:46,778 INFO L470 AbstractCegarLoop]: Abstraction has 3438 states and 4060 transitions. [2021-10-28 09:26:46,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10-28 09:26:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4060 transitions. [2021-10-28 09:26:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-28 09:26:46,782 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:46,782 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:26:46,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:26:46,783 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2021-10-28 09:26:46,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:46,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864316353] [2021-10-28 09:26:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:46,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:26:46,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:46,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864316353] [2021-10-28 09:26:46,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864316353] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:46,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:46,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:46,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204126319] [2021-10-28 09:26:46,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:46,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:46,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:46,824 INFO L87 Difference]: Start difference. First operand 3438 states and 4060 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-10-28 09:26:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:47,179 INFO L93 Difference]: Finished difference Result 7668 states and 8983 transitions. [2021-10-28 09:26:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:47,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 116 [2021-10-28 09:26:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:47,193 INFO L225 Difference]: With dead ends: 7668 [2021-10-28 09:26:47,193 INFO L226 Difference]: Without dead ends: 2540 [2021-10-28 09:26:47,201 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-10-28 09:26:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2021-10-28 09:26:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2462. [2021-10-28 09:26:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2461 states have (on average 1.1312474603819584) internal successors, (2784), 2461 states have internal predecessors, (2784), 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-10-28 09:26:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2784 transitions. [2021-10-28 09:26:47,432 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2784 transitions. Word has length 116 [2021-10-28 09:26:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:47,432 INFO L470 AbstractCegarLoop]: Abstraction has 2462 states and 2784 transitions. [2021-10-28 09:26:47,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-10-28 09:26:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2784 transitions. [2021-10-28 09:26:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-28 09:26:47,435 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:47,436 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:26:47,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:26:47,436 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2021-10-28 09:26:47,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:47,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002548513] [2021-10-28 09:26:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:47,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:26:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:26:47,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:26:47,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002548513] [2021-10-28 09:26:47,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002548513] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:26:47,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:26:47,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:26:47,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283944044] [2021-10-28 09:26:47,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:26:47,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:26:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:26:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:26:47,483 INFO L87 Difference]: Start difference. First operand 2462 states and 2784 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-10-28 09:26:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:26:47,645 INFO L93 Difference]: Finished difference Result 4250 states and 4825 transitions. [2021-10-28 09:26:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:26:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2021-10-28 09:26:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:26:47,658 INFO L225 Difference]: With dead ends: 4250 [2021-10-28 09:26:47,658 INFO L226 Difference]: Without dead ends: 2462 [2021-10-28 09:26:47,661 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-10-28 09:26:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2021-10-28 09:26:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2021-10-28 09:26:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2461 states have (on average 1.1174319382364892) internal successors, (2750), 2461 states have internal predecessors, (2750), 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-10-28 09:26:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2750 transitions. [2021-10-28 09:26:47,825 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2750 transitions. Word has length 117 [2021-10-28 09:26:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:26:47,825 INFO L470 AbstractCegarLoop]: Abstraction has 2462 states and 2750 transitions. [2021-10-28 09:26:47,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-10-28 09:26:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2750 transitions. [2021-10-28 09:26:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-28 09:26:47,829 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:26:47,829 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:26:47,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:26:47,829 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:26:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:26:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2021-10-28 09:26:47,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:26:47,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158096323] [2021-10-28 09:26:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:26:47,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:26:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:26:47,848 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:26:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:26:47,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:26:47,935 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:26:47,937 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:26:47,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:26:47,942 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:26:47,945 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:26:48,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:26:48 BoogieIcfgContainer [2021-10-28 09:26:48,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:26:48,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:26:48,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:26:48,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:26:48,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:26:41" (3/4) ... [2021-10-28 09:26:48,075 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:26:48,215 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:26:48,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:26:48,217 INFO L168 Benchmark]: Toolchain (without parser) took 8184.36 ms. Allocated memory was 102.8 MB in the beginning and 469.8 MB in the end (delta: 367.0 MB). Free memory was 63.8 MB in the beginning and 425.3 MB in the end (delta: -361.6 MB). Peak memory consumption was 273.9 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,218 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 80.2 MB in the end (delta: 55.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:26:48,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.94 ms. Allocated memory is still 102.8 MB. Free memory was 63.5 MB in the beginning and 75.8 MB in the end (delta: -12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 72.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,219 INFO L168 Benchmark]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 102.8 MB. Free memory was 72.9 MB in the beginning and 70.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,219 INFO L168 Benchmark]: RCFGBuilder took 688.66 ms. Allocated memory is still 102.8 MB. Free memory was 70.5 MB in the beginning and 46.8 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,220 INFO L168 Benchmark]: TraceAbstraction took 6878.69 ms. Allocated memory was 102.8 MB in the beginning and 469.8 MB in the end (delta: 367.0 MB). Free memory was 46.4 MB in the beginning and 170.8 MB in the end (delta: -124.4 MB). Peak memory consumption was 244.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,220 INFO L168 Benchmark]: Witness Printer took 142.71 ms. Allocated memory is still 469.8 MB. Free memory was 170.8 MB in the beginning and 425.3 MB in the end (delta: -254.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2021-10-28 09:26:48,222 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.22 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 80.2 MB in the end (delta: 55.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 348.94 ms. Allocated memory is still 102.8 MB. Free memory was 63.5 MB in the beginning and 75.8 MB in the end (delta: -12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 72.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.13 ms. Allocated memory is still 102.8 MB. Free memory was 72.9 MB in the beginning and 70.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 688.66 ms. Allocated memory is still 102.8 MB. Free memory was 70.5 MB in the beginning and 46.8 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6878.69 ms. Allocated memory was 102.8 MB in the beginning and 469.8 MB in the end (delta: 367.0 MB). Free memory was 46.4 MB in the beginning and 170.8 MB in the end (delta: -124.4 MB). Peak memory consumption was 244.3 MB. Max. memory is 16.1 GB. * Witness Printer took 142.71 ms. Allocated memory is still 469.8 MB. Free memory was 170.8 MB in the beginning and 425.3 MB in the end (delta: -254.5 MB). Peak memory consumption was 14.9 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L326] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L331] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L336] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L341] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L346] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L164] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L183] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L359] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L364] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L369] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L374] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L55] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5256 SDtfs, 4833 SDslu, 4133 SDs, 0 SdLazy, 320 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3452occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 90/90 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-10-28 09:26:48,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72cf638e-9b78-4c2c-ad15-4a7d321087ff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...