./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.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_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 02:53:48,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 02:53:48,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 02:53:48,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 02:53:48,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 02:53:48,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 02:53:48,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 02:53:48,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 02:53:48,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 02:53:48,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 02:53:48,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 02:53:48,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 02:53:48,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 02:53:48,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 02:53:48,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 02:53:48,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 02:53:48,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 02:53:48,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 02:53:48,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 02:53:48,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 02:53:48,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 02:53:48,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 02:53:48,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 02:53:48,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 02:53:48,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 02:53:48,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 02:53:48,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 02:53:48,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 02:53:48,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 02:53:48,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 02:53:48,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 02:53:48,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 02:53:48,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 02:53:48,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 02:53:48,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 02:53:48,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 02:53:48,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 02:53:48,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 02:53:48,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 02:53:48,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 02:53:48,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 02:53:48,183 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 02:53:48,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 02:53:48,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 02:53:48,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 02:53:48,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 02:53:48,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 02:53:48,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 02:53:48,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 02:53:48,240 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 02:53:48,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 02:53:48,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 02:53:48,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 02:53:48,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 02:53:48,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 02:53:48,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 02:53:48,249 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 02:53:48,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 02:53:48,249 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 02:53:48,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 02:53:48,250 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 02:53:48,250 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 02:53:48,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 02:53:48,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 02:53:48,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 02:53:48,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 02:53:48,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 02:53:48,252 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 02:53:48,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 02:53:48,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 02:53:48,252 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_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/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_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI 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 -> Kojak 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2021-10-29 02:53:48,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 02:53:48,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 02:53:48,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 02:53:48,610 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 02:53:48,611 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 02:53:48,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-10-29 02:53:48,683 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/data/ce946cc2e/faba6d79e11b40a0ab4cfb1a8662255b/FLAGe6ce1fec0 [2021-10-29 02:53:49,196 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 02:53:49,197 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-10-29 02:53:49,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/data/ce946cc2e/faba6d79e11b40a0ab4cfb1a8662255b/FLAGe6ce1fec0 [2021-10-29 02:53:49,519 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/data/ce946cc2e/faba6d79e11b40a0ab4cfb1a8662255b [2021-10-29 02:53:49,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 02:53:49,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 02:53:49,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 02:53:49,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 02:53:49,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 02:53:49,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7e15ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49, skipping insertion in model container [2021-10-29 02:53:49,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 02:53:49,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 02:53:49,799 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_64ef31ab-ed76-414a-95cd-d2d902bc45a8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-10-29 02:53:49,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 02:53:49,813 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 02:53:49,857 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_64ef31ab-ed76-414a-95cd-d2d902bc45a8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-10-29 02:53:49,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 02:53:49,884 INFO L208 MainTranslator]: Completed translation [2021-10-29 02:53:49,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49 WrapperNode [2021-10-29 02:53:49,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 02:53:49,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 02:53:49,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 02:53:49,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 02:53:49,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 02:53:49,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 02:53:49,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 02:53:49,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 02:53:49,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:49,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:50,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:50,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:50,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:50,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 02:53:50,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 02:53:50,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 02:53:50,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 02:53:50,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:53:49" (1/1) ... [2021-10-29 02:53:50,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 02:53:50,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 02:53:50,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 02:53:50,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 02:53:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 02:53:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 02:53:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 02:53:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 02:53:51,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 02:53:51,339 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-10-29 02:53:51,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:53:51 BoogieIcfgContainer [2021-10-29 02:53:51,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 02:53:51,343 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 02:53:51,343 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 02:53:51,354 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 02:53:51,354 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:53:51" (1/1) ... [2021-10-29 02:53:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 02:53:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2021-10-29 02:53:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2021-10-29 02:53:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 02:53:51,412 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:51,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:51,861 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-29 02:53:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2021-10-29 02:53:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2021-10-29 02:53:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 02:53:51,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:51,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:52,161 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-29 02:53:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2021-10-29 02:53:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2021-10-29 02:53:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 02:53:52,362 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:52,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:52,516 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-29 02:53:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2021-10-29 02:53:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2021-10-29 02:53:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 02:53:52,874 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:52,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:53,019 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-29 02:53:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 24 states and 38 transitions. [2021-10-29 02:53:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2021-10-29 02:53:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 02:53:53,225 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:53,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:53:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:53:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 34 states and 65 transitions. [2021-10-29 02:53:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2021-10-29 02:53:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 02:53:56,778 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:53:56,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:53:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:53:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 42 states and 83 transitions. [2021-10-29 02:54:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 83 transitions. [2021-10-29 02:54:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 02:54:02,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:02,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 43 states and 87 transitions. [2021-10-29 02:54:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 87 transitions. [2021-10-29 02:54:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 02:54:03,405 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:03,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 51 states and 104 transitions. [2021-10-29 02:54:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2021-10-29 02:54:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:54:05,928 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:05,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 67 states and 152 transitions. [2021-10-29 02:54:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 152 transitions. [2021-10-29 02:54:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:54:12,954 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:12,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 69 states and 157 transitions. [2021-10-29 02:54:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 157 transitions. [2021-10-29 02:54:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:13,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:13,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 82 states and 188 transitions. [2021-10-29 02:54:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 188 transitions. [2021-10-29 02:54:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:20,291 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:20,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 98 states and 224 transitions. [2021-10-29 02:54:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2021-10-29 02:54:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:27,247 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:27,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 105 states and 245 transitions. [2021-10-29 02:54:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 245 transitions. [2021-10-29 02:54:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:31,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:31,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 106 states and 252 transitions. [2021-10-29 02:54:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 252 transitions. [2021-10-29 02:54:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:32,203 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:32,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 112 states and 274 transitions. [2021-10-29 02:54:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 274 transitions. [2021-10-29 02:54:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:36,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:36,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 113 states and 279 transitions. [2021-10-29 02:54:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 279 transitions. [2021-10-29 02:54:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 02:54:37,242 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:37,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:54:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:54:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 114 states and 285 transitions. [2021-10-29 02:54:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 285 transitions. [2021-10-29 02:54:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 02:54:38,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:54:38,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:54:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:54:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 140 states and 391 transitions. [2021-10-29 02:55:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 391 transitions. [2021-10-29 02:55:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 02:55:07,013 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:07,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 148 states and 426 transitions. [2021-10-29 02:55:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 426 transitions. [2021-10-29 02:55:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 02:55:16,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:16,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 149 states and 431 transitions. [2021-10-29 02:55:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 431 transitions. [2021-10-29 02:55:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 02:55:19,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:19,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 150 states and 436 transitions. [2021-10-29 02:55:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 436 transitions. [2021-10-29 02:55:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:55:22,217 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:22,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 166 states and 492 transitions. [2021-10-29 02:55:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 492 transitions. [2021-10-29 02:55:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:55:37,219 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:37,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 178 states and 521 transitions. [2021-10-29 02:55:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 521 transitions. [2021-10-29 02:55:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:55:50,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:50,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 180 states and 535 transitions. [2021-10-29 02:55:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 535 transitions. [2021-10-29 02:55:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:55:53,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:53,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:55:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:55:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:55:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 181 states and 552 transitions. [2021-10-29 02:55:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 552 transitions. [2021-10-29 02:55:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:55:55,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:55:55,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:55:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:56:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:56:19,489 WARN L207 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2021-10-29 02:57:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 200 states and 625 transitions. [2021-10-29 02:57:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 625 transitions. [2021-10-29 02:57:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:57:07,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:07,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:57:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 205 states and 633 transitions. [2021-10-29 02:57:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 633 transitions. [2021-10-29 02:57:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:57:16,102 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:16,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:57:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 210 states and 644 transitions. [2021-10-29 02:57:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 644 transitions. [2021-10-29 02:57:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:57:34,912 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:34,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 216 states and 654 transitions. [2021-10-29 02:58:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 654 transitions. [2021-10-29 02:58:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:58:03,884 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:03,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 223 states and 683 transitions. [2021-10-29 02:58:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 683 transitions. [2021-10-29 02:58:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 02:58:34,365 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:34,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 224 states and 697 transitions. [2021-10-29 02:58:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 697 transitions. [2021-10-29 02:58:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 02:58:36,928 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:36,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 232 states and 722 transitions. [2021-10-29 02:58:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 722 transitions. [2021-10-29 02:58:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 02:58:52,741 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:52,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 238 states and 736 transitions. [2021-10-29 02:59:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 736 transitions. [2021-10-29 02:59:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 02:59:05,915 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:05,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 244 states and 753 transitions. [2021-10-29 02:59:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 753 transitions. [2021-10-29 02:59:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 02:59:17,052 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:17,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 245 states and 762 transitions. [2021-10-29 02:59:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 762 transitions. [2021-10-29 02:59:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 02:59:19,188 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:19,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 252 states and 786 transitions. [2021-10-29 02:59:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 786 transitions. [2021-10-29 02:59:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 02:59:32,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:32,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 02:59:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 255 states and 803 transitions. [2021-10-29 02:59:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 803 transitions. [2021-10-29 02:59:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 02:59:38,041 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:38,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 257 states and 817 transitions. [2021-10-29 02:59:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 817 transitions. [2021-10-29 02:59:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 02:59:40,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:40,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 265 states and 861 transitions. [2021-10-29 02:59:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 861 transitions. [2021-10-29 02:59:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 02:59:59,596 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:59,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 266 states and 870 transitions. [2021-10-29 03:00:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 870 transitions. [2021-10-29 03:00:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:00:01,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:01,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 03:00:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 269 states and 879 transitions. [2021-10-29 03:00:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 879 transitions. [2021-10-29 03:00:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:00:06,350 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:06,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 274 states and 897 transitions. [2021-10-29 03:00:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 897 transitions. [2021-10-29 03:00:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:00:14,374 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:14,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 275 states and 909 transitions. [2021-10-29 03:00:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 909 transitions. [2021-10-29 03:00:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:00:17,772 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:17,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 03:00:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 281 states and 940 transitions. [2021-10-29 03:00:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 940 transitions. [2021-10-29 03:00:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:00:34,697 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:34,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 283 states and 950 transitions. [2021-10-29 03:00:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 950 transitions. [2021-10-29 03:00:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-29 03:00:37,240 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:37,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:00:37,462 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:00:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:00:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:00:38,086 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:00:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:00:38,432 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2021-10-29 03:00:38,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:00:38 ImpRootNode [2021-10-29 03:00:38,640 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:00:38,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:00:38,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:00:38,641 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:00:38,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:53:51" (3/4) ... [2021-10-29 03:00:38,643 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:00:38,822 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:00:38,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:00:38,823 INFO L168 Benchmark]: Toolchain (without parser) took 409299.05 ms. Allocated memory was 104.9 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 74.7 MB in the beginning and 813.2 MB in the end (delta: -738.5 MB). Peak memory consumption was 539.9 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,823 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 104.9 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:00:38,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.80 ms. Allocated memory is still 104.9 MB. Free memory was 74.4 MB in the beginning and 76.1 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 104.9 MB. Free memory was 76.1 MB in the beginning and 74.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,825 INFO L168 Benchmark]: Boogie Preprocessor took 84.94 ms. Allocated memory is still 104.9 MB. Free memory was 74.1 MB in the beginning and 72.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:00:38,825 INFO L168 Benchmark]: RCFGBuilder took 1298.81 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 72.7 MB in the beginning and 64.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,826 INFO L168 Benchmark]: CodeCheck took 407296.65 ms. Allocated memory was 125.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 64.7 MB in the beginning and 826.8 MB in the end (delta: -762.1 MB). Peak memory consumption was 495.8 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,826 INFO L168 Benchmark]: Witness Printer took 181.90 ms. Allocated memory is still 1.4 GB. Free memory was 826.8 MB in the beginning and 813.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:00:38,828 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 407.0s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1672082904 SDtfs, -657019228 SDslu, 267842700 SDs, 0 SdLazy, 314801546 SolverSat, 1590799978 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 165.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19090 GetRequests, 17522 SyntacticMatches, 736 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367341 ImplicationChecksByTransitivity, 352.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 60.1s InterpolantComputationTime, 1343 NumberOfCodeBlocks, 1343 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1252 ConstructedInterpolants, 0 QuantifiedInterpolants, 59122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 4 PerfectInterpolantSequences, 502/1734 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 282]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] port_t p2 ; [L35] char p2_old ; [L36] char p2_new ; [L37] char id2 ; [L38] char st2 ; [L39] msg_t send2 ; [L40] _Bool mode2 ; [L41] port_t p3 ; [L42] char p3_old ; [L43] char p3_new ; [L44] char id3 ; [L45] char st3 ; [L46] msg_t send3 ; [L47] _Bool mode3 ; [L229] int c1 ; [L230] int i2 ; [L233] c1 = 0 [L234] r1 = __VERIFIER_nondet_char() [L235] id1 = __VERIFIER_nondet_char() [L236] st1 = __VERIFIER_nondet_char() [L237] send1 = __VERIFIER_nondet_char() [L238] mode1 = __VERIFIER_nondet_bool() [L239] id2 = __VERIFIER_nondet_char() [L240] st2 = __VERIFIER_nondet_char() [L241] send2 = __VERIFIER_nondet_char() [L242] mode2 = __VERIFIER_nondet_bool() [L243] id3 = __VERIFIER_nondet_char() [L244] st3 = __VERIFIER_nondet_char() [L245] send3 = __VERIFIER_nondet_char() [L246] mode3 = __VERIFIER_nondet_bool() [L128] int tmp ; [L131] COND TRUE (int )r1 == 0 [L132] COND TRUE (int )id1 >= 0 [L133] COND TRUE (int )st1 == 0 [L134] COND TRUE (int )send1 == (int )id1 [L135] COND TRUE (int )mode1 == 0 [L136] COND TRUE (int )id2 >= 0 [L137] COND TRUE (int )st2 == 0 [L138] COND TRUE (int )send2 == (int )id2 [L139] COND TRUE (int )mode2 == 0 [L140] COND TRUE (int )id3 >= 0 [L141] COND TRUE (int )st3 == 0 [L142] COND TRUE (int )send3 == (int )id3 [L143] COND TRUE (int )mode3 == 0 [L144] COND TRUE (int )id1 != (int )id2 [L145] COND TRUE (int )id1 != (int )id3 [L146] COND TRUE (int )id2 != (int )id3 [L147] tmp = 1 [L196] return (tmp); [L247] i2 = init() [L248] COND FALSE !(!(i2)) [L249] p1_old = nomsg [L250] p1_new = nomsg [L251] p2_old = nomsg [L252] p2_new = nomsg [L253] p3_old = nomsg [L254] p3_new = nomsg [L255] i2 = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L224] return (tmp); [L267] c1 = check() [L280] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L269] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 [L68] mode1 = (_Bool)0 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 [L93] mode2 = (_Bool)0 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND FALSE !((int )m3 > (int )id3) [L114] COND FALSE !((int )m3 == (int )id3) [L118] mode3 = (_Bool)0 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L224] return (tmp); [L267] c1 = check() [L280] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L269] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L224] return (tmp); [L267] c1 = check() [L280] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L269] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 [L68] mode1 = (_Bool)0 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 [L93] mode2 = (_Bool)0 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 [L118] mode3 = (_Bool)0 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L224] return (tmp); [L267] c1 = check() [L280] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L269] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L224] return (tmp); [L267] c1 = check() [L280] COND FALSE !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L269] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND TRUE (int )m1 == (int )id1 [L63] st1 = (char)1 [L68] mode1 = (_Bool)0 [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 [L93] mode2 = (_Bool)0 [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND FALSE !((int )m3 > (int )id3) [L114] COND TRUE (int )m3 == (int )id3 [L115] st3 = (char)1 [L118] mode3 = (_Bool)0 [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L201] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L204] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L222] tmp = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L224] return (tmp); [L267] c1 = check() [L280] COND TRUE ! arg VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L282] reach_error() VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 104.9 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 348.80 ms. Allocated memory is still 104.9 MB. Free memory was 74.4 MB in the beginning and 76.1 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 104.9 MB. Free memory was 76.1 MB in the beginning and 74.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.94 ms. Allocated memory is still 104.9 MB. Free memory was 74.1 MB in the beginning and 72.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1298.81 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 72.7 MB in the beginning and 64.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. * CodeCheck took 407296.65 ms. Allocated memory was 125.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 64.7 MB in the beginning and 826.8 MB in the end (delta: -762.1 MB). Peak memory consumption was 495.8 MB. Max. memory is 16.1 GB. * Witness Printer took 181.90 ms. Allocated memory is still 1.4 GB. Free memory was 826.8 MB in the beginning and 813.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:00:38,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef31ab-ed76-414a-95cd-d2d902bc45a8/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...