./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/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_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/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_c5addf3b-84da-4fc4-859d-350f761e93ef/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 7039989391e70a09ea57155dc830398095342b5276a6311b81eee6000f87563d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16:25,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:16:25,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:16:25,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:16:25,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:16:25,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:16:25,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:16:25,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:16:25,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:16:25,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:16:25,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:16:25,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:16:25,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:16:25,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:16:25,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:16:25,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:16:25,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:16:25,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:16:25,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:16:25,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:16:25,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:16:25,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:16:25,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:16:25,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:16:25,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:16:25,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:16:25,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:16:25,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:16:25,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:16:25,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:16:25,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:16:25,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:16:25,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:16:25,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:16:25,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:16:25,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:16:25,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:16:25,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:16:25,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:16:25,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:16:25,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:16:25,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:16:25,272 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:16:25,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:16:25,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:16:25,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:16:25,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:16:25,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:16:25,274 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:16:25,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:16:25,275 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:16:25,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:16:25,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:16:25,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:16:25,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:16:25,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:16:25,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:16:25,276 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:16:25,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:16:25,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:16:25,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:16:25,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:16:25,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:16:25,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:16:25,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:16:25,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:16:25,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:16:25,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:16:25,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:16:25,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:16:25,279 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:16:25,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:16:25,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:16:25,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:16:25,280 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_c5addf3b-84da-4fc4-859d-350f761e93ef/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_c5addf3b-84da-4fc4-859d-350f761e93ef/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 -> 7039989391e70a09ea57155dc830398095342b5276a6311b81eee6000f87563d [2021-10-28 09:16:25,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:16:25,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:16:25,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:16:25,572 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:16:25,573 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:16:25,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-10-28 09:16:25,671 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/data/6dae95a49/ab9c4b8b26fd42ebb71d0f94a44e18c6/FLAG19e7d37c9 [2021-10-28 09:16:26,101 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:16:26,102 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-10-28 09:16:26,111 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/data/6dae95a49/ab9c4b8b26fd42ebb71d0f94a44e18c6/FLAG19e7d37c9 [2021-10-28 09:16:26,489 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/data/6dae95a49/ab9c4b8b26fd42ebb71d0f94a44e18c6 [2021-10-28 09:16:26,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:16:26,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:16:26,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:16:26,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:16:26,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:16:26,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdf7380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26, skipping insertion in model container [2021-10-28 09:16:26,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:16:26,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:16:26,694 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_c5addf3b-84da-4fc4-859d-350f761e93ef/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2021-10-28 09:16:26,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:16:26,758 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:16:26,768 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_c5addf3b-84da-4fc4-859d-350f761e93ef/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2021-10-28 09:16:26,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:16:26,809 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:16:26,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26 WrapperNode [2021-10-28 09:16:26,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:16:26,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:16:26,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:16:26,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:16:26,819 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:16:26" (1/1) ... [2021-10-28 09:16:26,827 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:16:26" (1/1) ... [2021-10-28 09:16:26,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:16:26,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:16:26,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:16:26,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:16:26,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:16:26,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:16:26,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:16:26,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:16:26,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (1/1) ... [2021-10-28 09:16:26,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:16:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:16:26,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:16:26,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:16:27,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:16:27,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:16:27,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:16:27,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:16:27,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:16:27,569 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-10-28 09:16:27,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:27 BoogieIcfgContainer [2021-10-28 09:16:27,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:16:27,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:16:27,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:16:27,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:16:27,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:16:26" (1/3) ... [2021-10-28 09:16:27,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c30dad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:16:27, skipping insertion in model container [2021-10-28 09:16:27,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:26" (2/3) ... [2021-10-28 09:16:27,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c30dad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:16:27, skipping insertion in model container [2021-10-28 09:16:27,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:27" (3/3) ... [2021-10-28 09:16:27,581 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-10-28 09:16:27,586 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:16:27,587 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:16:27,634 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:16:27,641 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:16:27,641 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 09:16:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:27,668 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:27,668 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:27,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-10-28 09:16:27,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:27,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510319604] [2021-10-28 09:16:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:27,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:27,845 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:16:27,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:27,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510319604] [2021-10-28 09:16:27,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510319604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:27,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:27,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:27,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576143812] [2021-10-28 09:16:27,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:27,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:27,877 INFO L87 Difference]: Start difference. First operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:27,942 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2021-10-28 09:16:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:27,955 INFO L225 Difference]: With dead ends: 291 [2021-10-28 09:16:27,955 INFO L226 Difference]: Without dead ends: 144 [2021-10-28 09:16:27,959 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:16:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-28 09:16:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-10-28 09:16:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2021-10-28 09:16:28,008 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2021-10-28 09:16:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,008 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2021-10-28 09:16:28,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2021-10-28 09:16:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:28,010 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,011 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:28,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:16:28,011 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-10-28 09:16:28,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744035440] [2021-10-28 09:16:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,168 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:16:28,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744035440] [2021-10-28 09:16:28,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744035440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:28,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737220487] [2021-10-28 09:16:28,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:28,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:28,173 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:28,228 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2021-10-28 09:16:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:28,232 INFO L225 Difference]: With dead ends: 384 [2021-10-28 09:16:28,233 INFO L226 Difference]: Without dead ends: 246 [2021-10-28 09:16:28,234 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:16:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-28 09:16:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2021-10-28 09:16:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.5083333333333333) internal successors, (362), 241 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2021-10-28 09:16:28,268 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2021-10-28 09:16:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,269 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2021-10-28 09:16:28,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2021-10-28 09:16:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:28,271 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,271 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:28,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:16:28,271 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-10-28 09:16:28,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036445813] [2021-10-28 09:16:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,314 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:16:28,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036445813] [2021-10-28 09:16:28,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036445813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:28,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005158080] [2021-10-28 09:16:28,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:28,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:28,318 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:28,363 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2021-10-28 09:16:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:28,375 INFO L225 Difference]: With dead ends: 477 [2021-10-28 09:16:28,375 INFO L226 Difference]: Without dead ends: 242 [2021-10-28 09:16:28,377 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:16:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-28 09:16:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-28 09:16:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.475) internal successors, (354), 241 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2021-10-28 09:16:28,420 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2021-10-28 09:16:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,420 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2021-10-28 09:16:28,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2021-10-28 09:16:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:28,428 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,428 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:28,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:16:28,428 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-10-28 09:16:28,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103545675] [2021-10-28 09:16:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,512 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:16:28,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103545675] [2021-10-28 09:16:28,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103545675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:28,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146228434] [2021-10-28 09:16:28,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:28,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:28,520 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:28,582 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2021-10-28 09:16:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:28,586 INFO L225 Difference]: With dead ends: 476 [2021-10-28 09:16:28,586 INFO L226 Difference]: Without dead ends: 242 [2021-10-28 09:16:28,592 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:16:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-28 09:16:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-28 09:16:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4166666666666667) internal successors, (340), 241 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2021-10-28 09:16:28,629 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2021-10-28 09:16:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,629 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2021-10-28 09:16:28,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2021-10-28 09:16:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:28,632 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,632 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:28,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:16:28,632 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-10-28 09:16:28,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579438027] [2021-10-28 09:16:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,717 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:16:28,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579438027] [2021-10-28 09:16:28,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579438027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:28,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486769808] [2021-10-28 09:16:28,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:28,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:28,721 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:28,829 INFO L93 Difference]: Finished difference Result 634 states and 896 transitions. [2021-10-28 09:16:28,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:28,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:28,833 INFO L225 Difference]: With dead ends: 634 [2021-10-28 09:16:28,833 INFO L226 Difference]: Without dead ends: 401 [2021-10-28 09:16:28,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-10-28 09:16:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 242. [2021-10-28 09:16:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4041666666666666) internal successors, (337), 241 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 337 transitions. [2021-10-28 09:16:28,860 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 337 transitions. Word has length 39 [2021-10-28 09:16:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,860 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 337 transitions. [2021-10-28 09:16:28,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 337 transitions. [2021-10-28 09:16:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:28,864 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,864 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:28,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:16:28,864 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-10-28 09:16:28,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895393022] [2021-10-28 09:16:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,966 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:16:28,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895393022] [2021-10-28 09:16:28,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895393022] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:28,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103920515] [2021-10-28 09:16:28,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:28,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:28,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:28,971 INFO L87 Difference]: Start difference. First operand 242 states and 337 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:29,124 INFO L93 Difference]: Finished difference Result 820 states and 1141 transitions. [2021-10-28 09:16:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:29,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:16:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:29,135 INFO L225 Difference]: With dead ends: 820 [2021-10-28 09:16:29,136 INFO L226 Difference]: Without dead ends: 589 [2021-10-28 09:16:29,137 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-10-28 09:16:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2021-10-28 09:16:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 539 states have (on average 1.37291280148423) internal successors, (740), 540 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 740 transitions. [2021-10-28 09:16:29,186 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 740 transitions. Word has length 39 [2021-10-28 09:16:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:29,188 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 740 transitions. [2021-10-28 09:16:29,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 740 transitions. [2021-10-28 09:16:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:29,190 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:29,190 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:29,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:16:29,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1134866542, now seen corresponding path program 1 times [2021-10-28 09:16:29,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:29,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493451991] [2021-10-28 09:16:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:29,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-28 09:16:29,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:29,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493451991] [2021-10-28 09:16:29,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493451991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:29,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:29,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:16:29,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703614750] [2021-10-28 09:16:29,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:16:29,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:16:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:29,291 INFO L87 Difference]: Start difference. First operand 541 states and 740 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:29,438 INFO L93 Difference]: Finished difference Result 1379 states and 1899 transitions. [2021-10-28 09:16:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:16:29,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-28 09:16:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:29,444 INFO L225 Difference]: With dead ends: 1379 [2021-10-28 09:16:29,444 INFO L226 Difference]: Without dead ends: 859 [2021-10-28 09:16:29,445 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:16:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-10-28 09:16:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2021-10-28 09:16:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 1.3428571428571427) internal successors, (752), 561 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2021-10-28 09:16:29,507 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2021-10-28 09:16:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:29,508 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2021-10-28 09:16:29,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2021-10-28 09:16:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:29,509 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:29,509 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:29,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:16:29,509 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2021-10-28 09:16:29,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:29,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898627881] [2021-10-28 09:16:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:29,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:29,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:29,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898627881] [2021-10-28 09:16:29,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898627881] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:29,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:29,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:29,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116031072] [2021-10-28 09:16:29,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:29,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:29,588 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:29,693 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2021-10-28 09:16:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:29,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-28 09:16:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:29,699 INFO L225 Difference]: With dead ends: 1555 [2021-10-28 09:16:29,700 INFO L226 Difference]: Without dead ends: 1018 [2021-10-28 09:16:29,701 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:16:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-10-28 09:16:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2021-10-28 09:16:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 980 states have (on average 1.292857142857143) internal successors, (1267), 981 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2021-10-28 09:16:29,793 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2021-10-28 09:16:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:29,794 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2021-10-28 09:16:29,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2021-10-28 09:16:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:29,795 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:29,795 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:29,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:16:29,796 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2021-10-28 09:16:29,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:29,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729912134] [2021-10-28 09:16:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:29,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:16:29,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:29,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729912134] [2021-10-28 09:16:29,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729912134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:29,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:29,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:29,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530688474] [2021-10-28 09:16:29,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:29,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:29,876 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:30,033 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2021-10-28 09:16:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-28 09:16:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:30,045 INFO L225 Difference]: With dead ends: 2328 [2021-10-28 09:16:30,045 INFO L226 Difference]: Without dead ends: 1624 [2021-10-28 09:16:30,047 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:16:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-10-28 09:16:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2021-10-28 09:16:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1332 states have (on average 1.2905405405405406) internal successors, (1719), 1333 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2021-10-28 09:16:30,165 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2021-10-28 09:16:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:30,165 INFO L470 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2021-10-28 09:16:30,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2021-10-28 09:16:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:30,167 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:30,167 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:30,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:16:30,168 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2021-10-28 09:16:30,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:30,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143503147] [2021-10-28 09:16:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:30,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:30,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:30,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143503147] [2021-10-28 09:16:30,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143503147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:30,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:30,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:16:30,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137309753] [2021-10-28 09:16:30,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:16:30,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:16:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:30,221 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:30,410 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2021-10-28 09:16:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:16:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-28 09:16:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:30,420 INFO L225 Difference]: With dead ends: 2606 [2021-10-28 09:16:30,421 INFO L226 Difference]: Without dead ends: 1600 [2021-10-28 09:16:30,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:16:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-10-28 09:16:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2021-10-28 09:16:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1344 states have (on average 1.2626488095238095) internal successors, (1697), 1345 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2021-10-28 09:16:30,540 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2021-10-28 09:16:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:30,540 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2021-10-28 09:16:30,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2021-10-28 09:16:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:30,542 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:30,542 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:30,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:16:30,543 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2021-10-28 09:16:30,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:30,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217269840] [2021-10-28 09:16:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:30,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:30,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:30,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217269840] [2021-10-28 09:16:30,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217269840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:30,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:30,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:30,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822637042] [2021-10-28 09:16:30,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:30,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:30,611 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:30,824 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2021-10-28 09:16:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-28 09:16:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:30,841 INFO L225 Difference]: With dead ends: 3754 [2021-10-28 09:16:30,841 INFO L226 Difference]: Without dead ends: 2454 [2021-10-28 09:16:30,846 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:16:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-10-28 09:16:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2021-10-28 09:16:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2424 states have (on average 1.2421617161716172) internal successors, (3011), 2425 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2021-10-28 09:16:31,063 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2021-10-28 09:16:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:31,064 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2021-10-28 09:16:31,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2021-10-28 09:16:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:31,065 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:31,066 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:31,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:16:31,066 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2021-10-28 09:16:31,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:31,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800807979] [2021-10-28 09:16:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:31,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:31,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:31,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800807979] [2021-10-28 09:16:31,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800807979] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:31,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:31,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:31,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311503913] [2021-10-28 09:16:31,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:31,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:31,113 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:31,346 INFO L93 Difference]: Finished difference Result 4272 states and 5305 transitions. [2021-10-28 09:16:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-28 09:16:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:31,357 INFO L225 Difference]: With dead ends: 4272 [2021-10-28 09:16:31,357 INFO L226 Difference]: Without dead ends: 1871 [2021-10-28 09:16:31,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-10-28 09:16:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2021-10-28 09:16:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1869 states have (on average 1.2241840556447299) internal successors, (2288), 1870 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2021-10-28 09:16:31,573 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2021-10-28 09:16:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:31,574 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2021-10-28 09:16:31,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2021-10-28 09:16:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:31,576 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:31,577 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:31,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:16:31,577 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2021-10-28 09:16:31,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:31,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081046642] [2021-10-28 09:16:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:31,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:16:31,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:31,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081046642] [2021-10-28 09:16:31,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081046642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:31,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:31,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:31,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541037307] [2021-10-28 09:16:31,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:31,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:31,612 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:31,812 INFO L93 Difference]: Finished difference Result 3739 states and 4570 transitions. [2021-10-28 09:16:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 09:16:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:31,821 INFO L225 Difference]: With dead ends: 3739 [2021-10-28 09:16:31,822 INFO L226 Difference]: Without dead ends: 1626 [2021-10-28 09:16:31,824 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2021-10-28 09:16:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1596. [2021-10-28 09:16:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.213927227101631) internal successors, (1935), 1595 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2021-10-28 09:16:31,942 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2021-10-28 09:16:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:31,943 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2021-10-28 09:16:31,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2021-10-28 09:16:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:31,945 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:31,945 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:31,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:16:31,946 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2021-10-28 09:16:31,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:31,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222424723] [2021-10-28 09:16:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:31,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:16:31,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:31,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222424723] [2021-10-28 09:16:31,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222424723] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:31,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:31,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:31,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512037324] [2021-10-28 09:16:31,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:31,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:31,988 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:32,113 INFO L93 Difference]: Finished difference Result 2602 states and 3124 transitions. [2021-10-28 09:16:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:32,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 09:16:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:32,118 INFO L225 Difference]: With dead ends: 2602 [2021-10-28 09:16:32,118 INFO L226 Difference]: Without dead ends: 716 [2021-10-28 09:16:32,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-28 09:16:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-10-28 09:16:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 714 states have (on average 1.1288515406162465) internal successors, (806), 715 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2021-10-28 09:16:32,177 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2021-10-28 09:16:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:32,177 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2021-10-28 09:16:32,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2021-10-28 09:16:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:32,179 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:32,179 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:32,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:16:32,180 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2021-10-28 09:16:32,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:32,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726987436] [2021-10-28 09:16:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:32,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:32,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:32,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726987436] [2021-10-28 09:16:32,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726987436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:32,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:32,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:32,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926065707] [2021-10-28 09:16:32,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:32,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:32,220 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:32,278 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2021-10-28 09:16:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:32,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 09:16:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:32,282 INFO L225 Difference]: With dead ends: 1048 [2021-10-28 09:16:32,282 INFO L226 Difference]: Without dead ends: 594 [2021-10-28 09:16:32,284 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:16:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-28 09:16:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-10-28 09:16:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 592 states have (on average 1.1182432432432432) internal successors, (662), 593 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2021-10-28 09:16:32,328 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2021-10-28 09:16:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:32,329 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2021-10-28 09:16:32,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2021-10-28 09:16:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 09:16:32,330 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:32,331 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:32,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:16:32,331 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2021-10-28 09:16:32,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:32,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476242208] [2021-10-28 09:16:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:32,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:16:32,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:32,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476242208] [2021-10-28 09:16:32,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476242208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:32,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:32,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:32,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315842743] [2021-10-28 09:16:32,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:32,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:32,399 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:32,460 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2021-10-28 09:16:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-28 09:16:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:32,464 INFO L225 Difference]: With dead ends: 598 [2021-10-28 09:16:32,465 INFO L226 Difference]: Without dead ends: 596 [2021-10-28 09:16:32,465 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-28 09:16:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2021-10-28 09:16:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.1150592216582065) internal successors, (659), 591 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2021-10-28 09:16:32,514 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2021-10-28 09:16:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:32,515 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2021-10-28 09:16:32,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2021-10-28 09:16:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-28 09:16:32,516 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:32,517 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:32,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:16:32,517 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2021-10-28 09:16:32,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:32,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077775847] [2021-10-28 09:16:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:32,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-28 09:16:32,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:32,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077775847] [2021-10-28 09:16:32,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077775847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:32,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:32,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:32,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106924650] [2021-10-28 09:16:32,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:32,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:32,551 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:32,633 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2021-10-28 09:16:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-10-28 09:16:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:32,639 INFO L225 Difference]: With dead ends: 1230 [2021-10-28 09:16:32,639 INFO L226 Difference]: Without dead ends: 900 [2021-10-28 09:16:32,640 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:16:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-10-28 09:16:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2021-10-28 09:16:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.1146711635750421) internal successors, (661), 593 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2021-10-28 09:16:32,697 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2021-10-28 09:16:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:32,698 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2021-10-28 09:16:32,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:16:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2021-10-28 09:16:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 09:16:32,700 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:32,700 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:32,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:16:32,700 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2021-10-28 09:16:32,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:32,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352826458] [2021-10-28 09:16:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:32,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:16:32,717 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:16:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:16:32,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:16:32,768 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:16:32,769 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:16:32,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:16:32,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:16:32,775 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:32,778 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:16:32,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:16:32 BoogieIcfgContainer [2021-10-28 09:16:32,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:16:32,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:16:32,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:16:32,907 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:16:32,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:27" (3/4) ... [2021-10-28 09:16:32,909 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:16:33,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:16:33,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:16:33,018 INFO L168 Benchmark]: Toolchain (without parser) took 6524.38 ms. Allocated memory was 125.8 MB in the beginning and 220.2 MB in the end (delta: 94.4 MB). Free memory was 88.4 MB in the beginning and 171.7 MB in the end (delta: -83.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,019 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory was 104.9 MB in the beginning and 104.8 MB in the end (delta: 119.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:16:33,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.63 ms. Allocated memory is still 125.8 MB. Free memory was 88.2 MB in the beginning and 98.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 125.8 MB. Free memory was 98.0 MB in the beginning and 95.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,020 INFO L168 Benchmark]: Boogie Preprocessor took 35.58 ms. Allocated memory is still 125.8 MB. Free memory was 95.9 MB in the beginning and 93.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,020 INFO L168 Benchmark]: RCFGBuilder took 662.33 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 73.4 MB in the end (delta: 20.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,021 INFO L168 Benchmark]: TraceAbstraction took 5332.16 ms. Allocated memory was 125.8 MB in the beginning and 220.2 MB in the end (delta: 94.4 MB). Free memory was 72.8 MB in the beginning and 185.3 MB in the end (delta: -112.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,021 INFO L168 Benchmark]: Witness Printer took 110.23 ms. Allocated memory is still 220.2 MB. Free memory was 185.3 MB in the beginning and 171.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:33,024 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.23 ms. Allocated memory is still 125.8 MB. Free memory was 104.9 MB in the beginning and 104.8 MB in the end (delta: 119.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.63 ms. Allocated memory is still 125.8 MB. Free memory was 88.2 MB in the beginning and 98.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 125.8 MB. Free memory was 98.0 MB in the beginning and 95.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.58 ms. Allocated memory is still 125.8 MB. Free memory was 95.9 MB in the beginning and 93.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 662.33 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 73.4 MB in the end (delta: 20.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5332.16 ms. Allocated memory was 125.8 MB in the beginning and 220.2 MB in the end (delta: 94.4 MB). Free memory was 72.8 MB in the beginning and 185.3 MB in the end (delta: -112.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 16.1 GB. * Witness Printer took 110.23 ms. Allocated memory is still 220.2 MB. Free memory was 185.3 MB in the beginning and 171.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L47] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3652 SDtfs, 4277 SDslu, 2959 SDs, 0 SdLazy, 416 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1154 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 197/197 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 09:16:33,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5addf3b-84da-4fc4-859d-350f761e93ef/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...