./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:25,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:25,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:25,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:25,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:25,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:25,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:25,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:25,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:25,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:25,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:25,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:25,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:25,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:25,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:25,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:25,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:25,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:25,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:25,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:25,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:25,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:25,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:25,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:25,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:25,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:25,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:25,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:25,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:25,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:25,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:25,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:25,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:25,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:25,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:25,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:25,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:25,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:25,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:25,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:25,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:25,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:22:25,650 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:25,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:25,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:25,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:25,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:25,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:25,653 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:25,654 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:25,654 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:25,654 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:25,654 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:25,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:25,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:25,656 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:25,657 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:25,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:25,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:25,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:25,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:25,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:25,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:25,659 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:25,659 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(F end) ) 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 -> 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c [2021-12-15 17:22:25,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:25,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:25,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:25,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:25,896 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:25,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:25,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780095ff/948d417936fa45b7801ddeb5723b64ad/FLAG69eb5c30f [2021-12-15 17:22:26,391 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:26,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:26,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780095ff/948d417936fa45b7801ddeb5723b64ad/FLAG69eb5c30f [2021-12-15 17:22:26,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780095ff/948d417936fa45b7801ddeb5723b64ad [2021-12-15 17:22:26,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:26,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:26,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:26,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:26,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:26,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2199fe62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26, skipping insertion in model container [2021-12-15 17:22:26,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:26,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:26,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979] [2021-12-15 17:22:26,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:26,704 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:26,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979] [2021-12-15 17:22:26,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:26,758 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:26,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26 WrapperNode [2021-12-15 17:22:26,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:26,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:26,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:26,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:26,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,817 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 426 [2021-12-15 17:22:26,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:26,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:26,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:26,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:26,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:26,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:26,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:26,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:26,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (1/1) ... [2021-12-15 17:22:26,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:26,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:26,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:22:26,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:22:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:27,032 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:27,033 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:27,435 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:27,441 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:27,445 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:27,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:27 BoogieIcfgContainer [2021-12-15 17:22:27,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:27,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:27,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:27,454 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:27,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:27,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:26" (1/3) ... [2021-12-15 17:22:27,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f9f7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:27, skipping insertion in model container [2021-12-15 17:22:27,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:27,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:26" (2/3) ... [2021-12-15 17:22:27,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f9f7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:27, skipping insertion in model container [2021-12-15 17:22:27,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:27,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:27" (3/3) ... [2021-12-15 17:22:27,458 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:27,505 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:27,506 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:27,506 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:27,506 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:27,506 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:27,506 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:27,506 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:27,507 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:27,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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-12-15 17:22:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:27,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:27,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:27,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:27,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:27,575 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:27,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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-12-15 17:22:27,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:27,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:27,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:27,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:27,596 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:27,603 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 32#L241true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 28#L244-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 55#L254true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 58#L257-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 25#L267true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 14#L270-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 96#L280true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 77#L283-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 119#L293true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 76#L296-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 131#L306true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 17#L309-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 138#L319true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 107#L319-1true init_#res#1 := init_~tmp___5~0#1; 113#L428true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 44#L22true assume !(0 == assume_abort_if_not_~cond#1); 98#L21true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 75#L536-2true [2021-12-15 17:22:27,608 INFO L793 eck$LassoCheckResult]: Loop: 75#L536-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 56#L79true assume !(0 != ~mode1~0 % 256); 128#L107true assume !(~r1~0 % 256 < 2); 121#L107-1true ~mode1~0 := 1; 41#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 89#L125true assume !(0 != ~mode2~0 % 256); 9#L153true assume !(~r2~0 % 256 < 2); 87#L153-1true ~mode2~0 := 1; 80#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 112#L171true assume !(0 != ~mode3~0 % 256); 50#L199true assume !(~r3~0 % 256 < 2); 137#L199-1true ~mode3~0 := 1; 84#L171-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 42#L436true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 27#L436-1true check_#res#1 := check_~tmp~1#1; 123#L484true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 18#L565true assume !(0 == assert_~arg#1 % 256); 21#L560true assume { :end_inline_assert } true; 75#L536-2true [2021-12-15 17:22:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-12-15 17:22:27,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8940106] [2021-12-15 17:22:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:27,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:27,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:27,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8940106] [2021-12-15 17:22:27,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8940106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:27,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:27,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:27,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349933816] [2021-12-15 17:22:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:27,833 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -912905468, now seen corresponding path program 1 times [2021-12-15 17:22:27,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577136887] [2021-12-15 17:22:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:27,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:27,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577136887] [2021-12-15 17:22:27,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577136887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:27,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:27,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:27,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74955847] [2021-12-15 17:22:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:27,914 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:27,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:27,947 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-15 17:22:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:28,029 INFO L93 Difference]: Finished difference Result 136 states and 231 transitions. [2021-12-15 17:22:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:28,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 231 transitions. [2021-12-15 17:22:28,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:28,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 131 states and 219 transitions. [2021-12-15 17:22:28,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:22:28,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:22:28,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 219 transitions. [2021-12-15 17:22:28,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:28,049 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 219 transitions. [2021-12-15 17:22:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:22:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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-12-15 17:22:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 219 transitions. [2021-12-15 17:22:28,083 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:28,084 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:28,084 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:28,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 219 transitions. [2021-12-15 17:22:28,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:28,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,088 INFO L843 BuchiCegarLoop]: Counterexample loop 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] [2021-12-15 17:22:28,089 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 341#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 301#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 338#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 347#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 334#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 307#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 314#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 392#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 401#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 349#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 400#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 319#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 320#L319 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 291#L319-1 init_#res#1 := init_~tmp___5~0#1; 416#L428 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 359#L22 assume !(0 == assume_abort_if_not_~cond#1); 360#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 324#L536-2 [2021-12-15 17:22:28,089 INFO L793 eck$LassoCheckResult]: Loop: 324#L536-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 376#L79 assume !(0 != ~mode1~0 % 256); 377#L107 assume !(~r1~0 % 256 < 2); 411#L107-1 ~mode1~0 := 1; 355#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 356#L125 assume !(0 != ~mode2~0 % 256); 303#L153 assume !(~r2~0 % 256 < 2); 304#L153-1 ~mode2~0 := 1; 299#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 404#L171 assume !(0 != ~mode3~0 % 256); 366#L199 assume !(~r3~0 % 256 < 2); 368#L199-1 ~mode3~0 := 1; 390#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 357#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 296#L437 assume ~st1~0 + ~nl1~0 <= 1; 297#L438 assume ~st2~0 + ~nl2~0 <= 1; 382#L439 assume ~st3~0 + ~nl3~0 <= 1; 383#L440 assume ~r1~0 % 256 >= 2; 389#L444 assume ~r1~0 % 256 < 2; 397#L449 assume ~r1~0 % 256 >= 2; 293#L454 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 294#L436-1 check_#res#1 := check_~tmp~1#1; 333#L484 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 317#L565 assume !(0 == assert_~arg#1 % 256); 318#L560 assume { :end_inline_assert } true; 324#L536-2 [2021-12-15 17:22:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-12-15 17:22:28,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254097248] [2021-12-15 17:22:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254097248] [2021-12-15 17:22:28,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254097248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:28,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077704363] [2021-12-15 17:22:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1635620540, now seen corresponding path program 1 times [2021-12-15 17:22:28,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538933281] [2021-12-15 17:22:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538933281] [2021-12-15 17:22:28,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538933281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:28,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498037040] [2021-12-15 17:22:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,215 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:28,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:28,216 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-12-15 17:22:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:28,290 INFO L93 Difference]: Finished difference Result 134 states and 221 transitions. [2021-12-15 17:22:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:28,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 221 transitions. [2021-12-15 17:22:28,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:28,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 131 states and 192 transitions. [2021-12-15 17:22:28,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:22:28,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:22:28,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 192 transitions. [2021-12-15 17:22:28,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:28,303 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 192 transitions. [2021-12-15 17:22:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:22:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.465648854961832) internal successors, (192), 130 states have internal predecessors, (192), 0 states have call successors, (0), 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-12-15 17:22:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2021-12-15 17:22:28,315 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:28,316 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:28,316 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:28,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 192 transitions. [2021-12-15 17:22:28,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:28,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,318 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,318 INFO L843 BuchiCegarLoop]: Counterexample loop 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] [2021-12-15 17:22:28,318 INFO L791 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 620#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 578#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 615#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 624#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 614#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 584#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 591#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 669#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 678#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 626#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 677#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 596#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 597#L319 assume ~id1~0 != ~id2~0; 682#L320 assume ~id1~0 != ~id3~0; 672#L321 assume ~id2~0 != ~id3~0; 673#L322 assume ~id1~0 >= 0; 568#L323 assume ~id2~0 >= 0; 569#L324 assume ~id3~0 >= 0; 593#L325 assume 0 == ~r1~0 % 256; 617#L326 assume 0 == ~r2~0 % 256; 599#L327 assume 0 == ~r3~0 % 256; 600#L328 assume 0 != init_~r122~0#1 % 256; 628#L329 assume 0 != init_~r132~0#1 % 256; 629#L330 assume 0 != init_~r212~0#1 % 256; 588#L331 assume 0 != init_~r232~0#1 % 256; 589#L332 assume 0 != init_~r312~0#1 % 256; 616#L333 assume 0 != init_~r322~0#1 % 256; 627#L334 assume ~max1~0 == ~id1~0; 605#L335 assume ~max2~0 == ~id2~0; 606#L336 assume ~max3~0 == ~id3~0; 680#L337 assume 0 == ~st1~0; 646#L338 assume 0 == ~st2~0; 647#L339 assume 0 == ~st3~0; 692#L340 assume 0 == ~nl1~0; 686#L341 assume 0 == ~nl2~0; 630#L342 assume 0 == ~nl3~0; 631#L343 assume 0 == ~mode1~0 % 256; 621#L344 assume 0 == ~mode2~0 % 256; 622#L345 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 693#L319-1 init_#res#1 := init_~tmp___5~0#1; 694#L428 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 636#L22 assume !(0 == assume_abort_if_not_~cond#1); 637#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 601#L536-2 [2021-12-15 17:22:28,318 INFO L793 eck$LassoCheckResult]: Loop: 601#L536-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 653#L79 assume !(0 != ~mode1~0 % 256); 654#L107 assume !(~r1~0 % 256 < 2); 688#L107-1 ~mode1~0 := 1; 632#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 633#L125 assume !(0 != ~mode2~0 % 256); 580#L153 assume !(~r2~0 % 256 < 2); 581#L153-1 ~mode2~0 := 1; 576#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 681#L171 assume !(0 != ~mode3~0 % 256); 643#L199 assume !(~r3~0 % 256 < 2); 645#L199-1 ~mode3~0 := 1; 667#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 634#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 573#L437 assume ~st1~0 + ~nl1~0 <= 1; 574#L438 assume ~st2~0 + ~nl2~0 <= 1; 659#L439 assume ~st3~0 + ~nl3~0 <= 1; 660#L440 assume ~r1~0 % 256 >= 2; 666#L444 assume ~r1~0 % 256 < 2; 674#L449 assume ~r1~0 % 256 >= 2; 570#L454 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 571#L436-1 check_#res#1 := check_~tmp~1#1; 613#L484 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 594#L565 assume !(0 == assert_~arg#1 % 256); 595#L560 assume { :end_inline_assert } true; 601#L536-2 [2021-12-15 17:22:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-12-15 17:22:28,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112290228] [2021-12-15 17:22:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,399 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1635620540, now seen corresponding path program 2 times [2021-12-15 17:22:28,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765681833] [2021-12-15 17:22:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765681833] [2021-12-15 17:22:28,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765681833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:28,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529162398] [2021-12-15 17:22:28,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,423 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:28,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:28,427 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-15 17:22:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:28,459 INFO L93 Difference]: Finished difference Result 189 states and 278 transitions. [2021-12-15 17:22:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:28,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 278 transitions. [2021-12-15 17:22:28,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 132 [2021-12-15 17:22:28,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 278 transitions. [2021-12-15 17:22:28,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2021-12-15 17:22:28,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2021-12-15 17:22:28,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 278 transitions. [2021-12-15 17:22:28,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:28,464 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 278 transitions. [2021-12-15 17:22:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 278 transitions. [2021-12-15 17:22:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2021-12-15 17:22:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 187 states have (on average 1.4705882352941178) internal successors, (275), 186 states have internal predecessors, (275), 0 states have call successors, (0), 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-12-15 17:22:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2021-12-15 17:22:28,471 INFO L704 BuchiCegarLoop]: Abstraction has 187 states and 275 transitions. [2021-12-15 17:22:28,471 INFO L587 BuchiCegarLoop]: Abstraction has 187 states and 275 transitions. [2021-12-15 17:22:28,471 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:28,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 275 transitions. [2021-12-15 17:22:28,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2021-12-15 17:22:28,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,474 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,474 INFO L843 BuchiCegarLoop]: Counterexample loop 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] [2021-12-15 17:22:28,474 INFO L791 eck$LassoCheckResult]: Stem: 1033#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 961#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 946#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 906#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 941#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 950#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 940#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 909#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 916#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 998#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1007#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 952#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1006#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 921#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 922#L319 assume ~id1~0 != ~id2~0; 1012#L320 assume ~id1~0 != ~id3~0; 1001#L321 assume ~id2~0 != ~id3~0; 1002#L322 assume ~id1~0 >= 0; 894#L323 assume ~id2~0 >= 0; 895#L324 assume ~id3~0 >= 0; 918#L325 assume 0 == ~r1~0 % 256; 943#L326 assume 0 == ~r2~0 % 256; 924#L327 assume 0 == ~r3~0 % 256; 925#L328 assume 0 != init_~r122~0#1 % 256; 954#L329 assume 0 != init_~r132~0#1 % 256; 955#L330 assume 0 != init_~r212~0#1 % 256; 913#L331 assume 0 != init_~r232~0#1 % 256; 914#L332 assume 0 != init_~r312~0#1 % 256; 942#L333 assume 0 != init_~r322~0#1 % 256; 953#L334 assume ~max1~0 == ~id1~0; 930#L335 assume ~max2~0 == ~id2~0; 931#L336 assume ~max3~0 == ~id3~0; 1009#L337 assume 0 == ~st1~0; 973#L338 assume 0 == ~st2~0; 974#L339 assume 0 == ~st3~0; 1025#L340 assume 0 == ~nl1~0; 1017#L341 assume 0 == ~nl2~0; 956#L342 assume 0 == ~nl3~0; 957#L343 assume 0 == ~mode1~0 % 256; 947#L344 assume 0 == ~mode2~0 % 256; 948#L345 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 1026#L319-1 init_#res#1 := init_~tmp___5~0#1; 1027#L428 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 962#L22 assume !(0 == assume_abort_if_not_~cond#1); 963#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1021#L536-2 [2021-12-15 17:22:28,475 INFO L793 eck$LassoCheckResult]: Loop: 1021#L536-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1036#L79 assume !(0 != ~mode1~0 % 256); 1035#L107 assume ~r1~0 % 256 < 2; 927#L108 assume !(0 != ~ep12~0 % 256); 928#L108-2 assume !(0 != ~ep13~0 % 256); 1019#L107-1 ~mode1~0 := 1; 958#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 959#L125 assume !(0 != ~mode2~0 % 256); 902#L153 assume !(~r2~0 % 256 < 2); 903#L153-1 ~mode2~0 := 1; 901#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1010#L171 assume !(0 != ~mode3~0 % 256); 970#L199 assume !(~r3~0 % 256 < 2); 972#L199-1 ~mode3~0 := 1; 996#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1046#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1045#L437 assume ~st1~0 + ~nl1~0 <= 1; 1044#L438 assume ~st2~0 + ~nl2~0 <= 1; 1043#L439 assume ~st3~0 + ~nl3~0 <= 1; 1042#L440 assume !(~r1~0 % 256 >= 2); 994#L443 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 995#L444 assume ~r1~0 % 256 < 2; 1041#L449 assume !(~r1~0 % 256 >= 2); 964#L453 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 965#L454 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 1040#L436-1 check_#res#1 := check_~tmp~1#1; 1039#L484 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1038#L565 assume !(0 == assert_~arg#1 % 256); 1037#L560 assume { :end_inline_assert } true; 1021#L536-2 [2021-12-15 17:22:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-12-15 17:22:28,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727808573] [2021-12-15 17:22:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,531 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1492715509, now seen corresponding path program 1 times [2021-12-15 17:22:28,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557273702] [2021-12-15 17:22:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:28,559 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1849804105, now seen corresponding path program 1 times [2021-12-15 17:22:28,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023856454] [2021-12-15 17:22:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023856454] [2021-12-15 17:22:28,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023856454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:28,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325064694] [2021-12-15 17:22:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:29,180 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:22:29,184 INFO L158 Benchmark]: Toolchain (without parser) took 2761.18ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 85.6MB in the beginning and 112.1MB in the end (delta: -26.5MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,184 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:29,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.10ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 87.8MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 119.5MB. Free memory was 87.8MB in the beginning and 84.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,185 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 119.5MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,185 INFO L158 Benchmark]: RCFGBuilder took 593.68ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 58.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,186 INFO L158 Benchmark]: BuchiAutomizer took 1732.33ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 58.9MB in the beginning and 112.1MB in the end (delta: -53.2MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,188 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.14ms. Allocated memory is still 79.7MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.10ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 87.8MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 119.5MB. Free memory was 87.8MB in the beginning and 84.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 119.5MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.68ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 58.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1732.33ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 58.9MB in the beginning and 112.1MB in the end (delta: -53.2MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:22:29,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable