./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_lcr.5_overflow.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 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:29:52,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:29:52,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:29:52,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:29:52,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:29:52,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:29:52,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:29:52,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:29:52,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:29:52,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:29:52,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:29:52,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:29:52,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:29:52,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:29:52,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:29:52,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:29:52,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:29:52,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:29:52,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:29:52,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:29:52,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:29:52,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:29:52,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:29:52,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:29:52,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:29:52,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:29:52,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:29:52,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:29:52,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:29:52,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:29:52,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:29:52,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:29:52,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:29:52,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:29:52,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:29:52,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:29:52,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:29:52,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:29:52,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:29:52,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:29:52,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:29:52,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:29:52,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:29:52,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:29:52,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:29:52,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:29:52,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:29:52,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:29:52,580 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:29:52,580 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:29:52,581 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:29:52,581 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:29:52,581 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:29:52,581 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:29:52,582 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:29:52,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:29:52,582 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:29:52,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:29:52,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:29:52,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:29:52,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:29:52,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:29:52,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:29:52,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:29:52,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:29:52,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:29:52,584 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:29:52,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:29:52,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:29:52,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:29:52,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:29:52,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:29:52,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:29:52,586 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:29:52,586 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 -> 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 [2022-02-21 04:29:52,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:29:52,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:29:52,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:29:52,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:29:52,787 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:29:52,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:52,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95b7d5d4/cb543128ead24d14be1612242b37064f/FLAG4672f047d [2022-02-21 04:29:53,266 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:29:53,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:53,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95b7d5d4/cb543128ead24d14be1612242b37064f/FLAG4672f047d [2022-02-21 04:29:53,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95b7d5d4/cb543128ead24d14be1612242b37064f [2022-02-21 04:29:53,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:29:53,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:29:53,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:53,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:29:53,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:29:53,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526136bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53, skipping insertion in model container [2022-02-21 04:29:53,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:29:53,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:29:53,577 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_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-02-21 04:29:53,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:53,584 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:29:53,641 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_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-02-21 04:29:53,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:53,662 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:29:53,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53 WrapperNode [2022-02-21 04:29:53,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:53,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:53,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:29:53,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:29:53,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,727 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 312 [2022-02-21 04:29:53,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:53,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:29:53,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:29:53,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:29:53,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:29:53,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:29:53,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:29:53,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:29:53,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (1/1) ... [2022-02-21 04:29:53,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:53,812 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) [2022-02-21 04:29:53,831 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 [2022-02-21 04:29:53,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:29:53,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:29:53,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:29:53,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:29:53,946 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:29:53,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:29:54,363 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:29:54,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:29:54,368 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:29:54,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:54 BoogieIcfgContainer [2022-02-21 04:29:54,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:29:54,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:29:54,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:29:54,373 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:29:54,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:54,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:29:53" (1/3) ... [2022-02-21 04:29:54,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3984ec61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:54, skipping insertion in model container [2022-02-21 04:29:54,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:54,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:53" (2/3) ... [2022-02-21 04:29:54,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3984ec61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:54, skipping insertion in model container [2022-02-21 04:29:54,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:54,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:54" (3/3) ... [2022-02-21 04:29:54,378 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:54,404 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:29:54,405 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:29:54,405 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:29:54,405 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:29:54,405 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:29:54,405 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:29:54,405 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:29:54,405 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:29:54,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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) [2022-02-21 04:29:54,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:29:54,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:54,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:54,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:54,449 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] [2022-02-21 04:29:54,449 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:29:54,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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) [2022-02-21 04:29:54,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:29:54,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:54,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:54,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:54,458 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] [2022-02-21 04:29:54,463 INFO L791 eck$LassoCheckResult]: Stem: 71#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 54#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 8#L198true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 34#L198-1true init_#res#1 := init_~tmp~0#1; 5#L323true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 65#L24true assume !(0 == assume_abort_if_not_~cond#1); 21#L23true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 19#L395-2true [2022-02-21 04:29:54,464 INFO L793 eck$LassoCheckResult]: Loop: 19#L395-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 43#L73true assume !(0 != ~mode1~0 % 256); 78#L87true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 7#L87-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 44#L73-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 57#L99true assume !(0 != ~mode2~0 % 256); 72#L112true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 82#L112-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 62#L99-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 22#L124true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 76#L127true assume !(node3_~m3~0#1 != ~nomsg~0); 28#L127-1true ~mode3~0 := 0; 88#L124-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 35#L149true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 42#L152true assume !(node4_~m4~0#1 != ~nomsg~0); 15#L152-1true ~mode4~0 := 0; 70#L149-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 86#L174true assume !(0 != ~mode5~0 % 256); 75#L187true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 23#L187-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 61#L174-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 16#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 39#L331-1true check_#res#1 := check_~tmp~1#1; 4#L351true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 59#L424true assume !(0 == assert_~arg#1 % 256); 6#L419true assume { :end_inline_assert } true; 19#L395-2true [2022-02-21 04:29:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2022-02-21 04:29:54,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:54,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84848314] [2022-02-21 04:29:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:54,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {96#true} is VALID [2022-02-21 04:29:54,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {96#true} is VALID [2022-02-21 04:29:54,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {98#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:29:54,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {98#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {99#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:29:54,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:29:54,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {97#false} is VALID [2022-02-21 04:29:54,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {97#false} is VALID [2022-02-21 04:29:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:54,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:54,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84848314] [2022-02-21 04:29:54,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84848314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:54,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:54,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:54,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268500010] [2022-02-21 04:29:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:54,661 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:29:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 698064284, now seen corresponding path program 1 times [2022-02-21 04:29:54,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:54,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100823822] [2022-02-21 04:29:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:54,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume !(0 != ~mode1~0 % 256); {101#true} is VALID [2022-02-21 04:29:54,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {101#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {101#true} is VALID [2022-02-21 04:29:54,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {101#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {101#true} is VALID [2022-02-21 04:29:54,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {101#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {101#true} assume !(0 != ~mode2~0 % 256); {101#true} is VALID [2022-02-21 04:29:54,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {101#true} is VALID [2022-02-21 04:29:54,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {101#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {101#true} is VALID [2022-02-21 04:29:54,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#true} assume !(node3_~m3~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:54,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#true} ~mode3~0 := 0; {101#true} is VALID [2022-02-21 04:29:54,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {101#true} assume !(node4_~m4~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:54,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {101#true} ~mode4~0 := 0; {101#true} is VALID [2022-02-21 04:29:54,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {101#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:54,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {101#true} assume !(0 != ~mode5~0 % 256); {101#true} is VALID [2022-02-21 04:29:54,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {101#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {101#true} is VALID [2022-02-21 04:29:54,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {101#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {101#true} is VALID [2022-02-21 04:29:54,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {101#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {101#true} is VALID [2022-02-21 04:29:54,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {101#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {103#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:54,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {103#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {104#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:54,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {105#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:29:54,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {102#false} is VALID [2022-02-21 04:29:54,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {102#false} assume { :end_inline_assert } true; {102#false} is VALID [2022-02-21 04:29:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:54,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:54,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100823822] [2022-02-21 04:29:54,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100823822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:54,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:54,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:54,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399130978] [2022-02-21 04:29:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:54,840 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:54,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:54,870 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 04:29:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,194 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2022-02-21 04:29:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:55,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 04:29:55,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:55,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 151 transitions. [2022-02-21 04:29:55,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:55,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 117 transitions. [2022-02-21 04:29:55,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2022-02-21 04:29:55,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2022-02-21 04:29:55,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2022-02-21 04:29:55,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:55,218 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2022-02-21 04:29:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-21 04:29:55,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:55,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:55,240 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:55,242 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,251 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2022-02-21 04:29:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:55,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:55,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:55,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states and 117 transitions. [2022-02-21 04:29:55,253 INFO L87 Difference]: Start difference. First operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states and 117 transitions. [2022-02-21 04:29:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,259 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2022-02-21 04:29:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:55,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:55,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:55,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:55,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-02-21 04:29:55,265 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:55,265 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:55,265 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:29:55,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:55,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:55,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:55,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:55,268 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] [2022-02-21 04:29:55,268 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] [2022-02-21 04:29:55,268 INFO L791 eck$LassoCheckResult]: Stem: 280#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 209#L198 assume 0 == ~r1~0 % 256; 210#L199 assume ~id1~0 >= 0; 267#L200 assume 0 == ~st1~0; 268#L201 assume ~send1~0 == ~id1~0; 245#L202 assume 0 == ~mode1~0 % 256; 246#L203 assume ~id2~0 >= 0; 262#L204 assume 0 == ~st2~0; 218#L205 assume ~send2~0 == ~id2~0; 219#L206 assume 0 == ~mode2~0 % 256; 211#L207 assume ~id3~0 >= 0; 212#L208 assume 0 == ~st3~0; 270#L209 assume ~send3~0 == ~id3~0; 223#L210 assume 0 == ~mode3~0 % 256; 224#L211 assume ~id4~0 >= 0; 213#L212 assume 0 == ~st4~0; 214#L213 assume ~send4~0 == ~id4~0; 285#L214 assume 0 == ~mode4~0 % 256; 286#L215 assume ~id5~0 >= 0; 269#L216 assume 0 == ~st5~0; 251#L217 assume ~send5~0 == ~id5~0; 252#L218 assume 0 == ~mode5~0 % 256; 272#L219 assume ~id1~0 != ~id2~0; 287#L220 assume ~id1~0 != ~id3~0; 244#L221 assume ~id1~0 != ~id4~0; 242#L222 assume ~id1~0 != ~id5~0; 243#L223 assume ~id2~0 != ~id3~0; 234#L224 assume ~id2~0 != ~id4~0; 235#L225 assume ~id2~0 != ~id5~0; 229#L226 assume ~id3~0 != ~id4~0; 230#L227 assume ~id3~0 != ~id5~0; 247#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 248#L198-1 init_#res#1 := init_~tmp~0#1; 203#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 204#L24 assume !(0 == assume_abort_if_not_~cond#1); 236#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 206#L395-2 [2022-02-21 04:29:55,269 INFO L793 eck$LassoCheckResult]: Loop: 206#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 233#L73 assume !(0 != ~mode1~0 % 256); 264#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 207#L87-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 208#L73-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 265#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 273#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 253#L102-1 ~mode2~0 := 0; 254#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 237#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 238#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 249#L127-1 ~mode3~0 := 0; 250#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 257#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 258#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 216#L152-1 ~mode4~0 := 0; 225#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 279#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 282#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 261#L177-1 ~mode5~0 := 0; 241#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 226#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 227#L331-1 check_#res#1 := check_~tmp~1#1; 201#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 202#L424 assume !(0 == assert_~arg#1 % 256); 205#L419 assume { :end_inline_assert } true; 206#L395-2 [2022-02-21 04:29:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2022-02-21 04:29:55,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:55,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491164453] [2022-02-21 04:29:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:55,306 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:55,368 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1420109744, now seen corresponding path program 1 times [2022-02-21 04:29:55,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:55,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640999340] [2022-02-21 04:29:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {467#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 != ~mode1~0 % 256); {467#true} is VALID [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {467#true} is VALID [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {467#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {467#true} is VALID [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {467#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#true} assume !(node2_~m2~0#1 != ~nomsg~0); {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#true} ~mode2~0 := 0; {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#true} assume !(node3_~m3~0#1 != ~nomsg~0); {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#true} ~mode3~0 := 0; {467#true} is VALID [2022-02-21 04:29:55,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(node4_~m4~0#1 != ~nomsg~0); {467#true} is VALID [2022-02-21 04:29:55,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {467#true} ~mode4~0 := 0; {467#true} is VALID [2022-02-21 04:29:55,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {467#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {467#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {467#true} is VALID [2022-02-21 04:29:55,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#true} assume !(node5_~m5~0#1 != ~nomsg~0); {467#true} is VALID [2022-02-21 04:29:55,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#true} ~mode5~0 := 0; {467#true} is VALID [2022-02-21 04:29:55,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {467#true} is VALID [2022-02-21 04:29:55,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {467#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {469#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:55,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {469#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {470#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:55,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {470#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {471#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:29:55,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {471#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {468#false} is VALID [2022-02-21 04:29:55,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {468#false} assume { :end_inline_assert } true; {468#false} is VALID [2022-02-21 04:29:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:55,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:55,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640999340] [2022-02-21 04:29:55,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640999340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:55,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:55,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:55,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331976394] [2022-02-21 04:29:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:55,492 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:55,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:55,493 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-02-21 04:29:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,722 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2022-02-21 04:29:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:55,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-02-21 04:29:55,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:55,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2022-02-21 04:29:55,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:55,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2022-02-21 04:29:55,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2022-02-21 04:29:55,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2022-02-21 04:29:55,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2022-02-21 04:29:55,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:55,751 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2022-02-21 04:29:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-21 04:29:55,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:55,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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) [2022-02-21 04:29:55,755 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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) [2022-02-21 04:29:55,755 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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) [2022-02-21 04:29:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,757 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-21 04:29:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:55,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:55,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:55,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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 87 states and 114 transitions. [2022-02-21 04:29:55,758 INFO L87 Difference]: Start difference. First operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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 87 states and 114 transitions. [2022-02-21 04:29:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:55,760 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-21 04:29:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:55,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:55,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:55,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:55,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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) [2022-02-21 04:29:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2022-02-21 04:29:55,763 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:55,763 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:55,763 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:29:55,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:55,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:55,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:55,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:55,765 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] [2022-02-21 04:29:55,765 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] [2022-02-21 04:29:55,766 INFO L791 eck$LassoCheckResult]: Stem: 645#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 636#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 574#L198 assume 0 == ~r1~0 % 256; 575#L199 assume ~id1~0 >= 0; 632#L200 assume 0 == ~st1~0; 633#L201 assume ~send1~0 == ~id1~0; 610#L202 assume 0 == ~mode1~0 % 256; 611#L203 assume ~id2~0 >= 0; 627#L204 assume 0 == ~st2~0; 583#L205 assume ~send2~0 == ~id2~0; 584#L206 assume 0 == ~mode2~0 % 256; 576#L207 assume ~id3~0 >= 0; 577#L208 assume 0 == ~st3~0; 635#L209 assume ~send3~0 == ~id3~0; 585#L210 assume 0 == ~mode3~0 % 256; 586#L211 assume ~id4~0 >= 0; 578#L212 assume 0 == ~st4~0; 579#L213 assume ~send4~0 == ~id4~0; 650#L214 assume 0 == ~mode4~0 % 256; 651#L215 assume ~id5~0 >= 0; 634#L216 assume 0 == ~st5~0; 618#L217 assume ~send5~0 == ~id5~0; 619#L218 assume 0 == ~mode5~0 % 256; 637#L219 assume ~id1~0 != ~id2~0; 652#L220 assume ~id1~0 != ~id3~0; 609#L221 assume ~id1~0 != ~id4~0; 607#L222 assume ~id1~0 != ~id5~0; 608#L223 assume ~id2~0 != ~id3~0; 599#L224 assume ~id2~0 != ~id4~0; 600#L225 assume ~id2~0 != ~id5~0; 593#L226 assume ~id3~0 != ~id4~0; 594#L227 assume ~id3~0 != ~id5~0; 612#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 613#L198-1 init_#res#1 := init_~tmp~0#1; 570#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 571#L24 assume !(0 == assume_abort_if_not_~cond#1); 604#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 569#L395-2 [2022-02-21 04:29:55,766 INFO L793 eck$LassoCheckResult]: Loop: 569#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 598#L73 assume !(0 != ~mode1~0 % 256); 629#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 572#L87-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 573#L73-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 630#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 638#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 616#L102-1 ~mode2~0 := 0; 617#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 601#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 602#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 614#L127-1 ~mode3~0 := 0; 615#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 622#L149 assume !(0 != ~mode4~0 % 256); 624#L162 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 631#L162-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 590#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 644#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 647#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 626#L177-1 ~mode5~0 := 0; 606#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 591#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 592#L332 assume ~r1~0 % 256 >= 5; 595#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 596#L331-1 check_#res#1 := check_~tmp~1#1; 566#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 567#L424 assume !(0 == assert_~arg#1 % 256); 568#L419 assume { :end_inline_assert } true; 569#L395-2 [2022-02-21 04:29:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2022-02-21 04:29:55,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:55,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894942341] [2022-02-21 04:29:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:55,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:55,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 6707478, now seen corresponding path program 1 times [2022-02-21 04:29:55,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:55,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901026466] [2022-02-21 04:29:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:55,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#true} assume !(0 != ~mode1~0 % 256); {832#true} is VALID [2022-02-21 04:29:55,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {832#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {832#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {832#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#true} assume !(node2_~m2~0#1 != ~nomsg~0); {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#true} ~mode2~0 := 0; {832#true} is VALID [2022-02-21 04:29:55,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#true} assume !(node3_~m3~0#1 != ~nomsg~0); {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#true} ~mode3~0 := 0; {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {832#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {832#true} assume !(0 != ~mode4~0 % 256); {832#true} is VALID [2022-02-21 04:29:55,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {832#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#true} assume !(node5_~m5~0#1 != ~nomsg~0); {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#true} ~mode5~0 := 0; {832#true} is VALID [2022-02-21 04:29:55,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {832#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {832#true} is VALID [2022-02-21 04:29:55,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {832#true} is VALID [2022-02-21 04:29:55,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {832#true} assume ~r1~0 % 256 >= 5; {834#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} is VALID [2022-02-21 04:29:55,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {834#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {833#false} is VALID [2022-02-21 04:29:55,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {833#false} check_#res#1 := check_~tmp~1#1; {833#false} is VALID [2022-02-21 04:29:55,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {833#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {833#false} is VALID [2022-02-21 04:29:55,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {833#false} assume !(0 == assert_~arg#1 % 256); {833#false} is VALID [2022-02-21 04:29:55,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {833#false} assume { :end_inline_assert } true; {833#false} is VALID [2022-02-21 04:29:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:55,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:55,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901026466] [2022-02-21 04:29:55,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901026466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:55,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:55,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:29:55,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822174535] [2022-02-21 04:29:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:55,858 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:55,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:55,859 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-02-21 04:29:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:56,002 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:29:56,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-02-21 04:29:56,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:56,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-02-21 04:29:56,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2022-02-21 04:29:56,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-02-21 04:29:56,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-02-21 04:29:56,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:56,027 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-02-21 04:29:56,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:56,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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) [2022-02-21 04:29:56,031 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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) [2022-02-21 04:29:56,032 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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) [2022-02-21 04:29:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:56,034 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:56,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:56,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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 131 states and 180 transitions. [2022-02-21 04:29:56,036 INFO L87 Difference]: Start difference. First operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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 131 states and 180 transitions. [2022-02-21 04:29:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:56,038 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:56,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:56,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:56,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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) [2022-02-21 04:29:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2022-02-21 04:29:56,042 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:56,042 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:56,042 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:29:56,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:56,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-02-21 04:29:56,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:56,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:56,044 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] [2022-02-21 04:29:56,044 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] [2022-02-21 04:29:56,044 INFO L791 eck$LassoCheckResult]: Stem: 1048#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 1039#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 974#L198 assume 0 == ~r1~0 % 256; 975#L199 assume ~id1~0 >= 0; 1035#L200 assume 0 == ~st1~0; 1036#L201 assume ~send1~0 == ~id1~0; 1010#L202 assume 0 == ~mode1~0 % 256; 1011#L203 assume ~id2~0 >= 0; 1027#L204 assume 0 == ~st2~0; 980#L205 assume ~send2~0 == ~id2~0; 981#L206 assume 0 == ~mode2~0 % 256; 976#L207 assume ~id3~0 >= 0; 977#L208 assume 0 == ~st3~0; 1038#L209 assume ~send3~0 == ~id3~0; 985#L210 assume 0 == ~mode3~0 % 256; 986#L211 assume ~id4~0 >= 0; 978#L212 assume 0 == ~st4~0; 979#L213 assume ~send4~0 == ~id4~0; 1053#L214 assume 0 == ~mode4~0 % 256; 1054#L215 assume ~id5~0 >= 0; 1037#L216 assume 0 == ~st5~0; 1017#L217 assume ~send5~0 == ~id5~0; 1018#L218 assume 0 == ~mode5~0 % 256; 1040#L219 assume ~id1~0 != ~id2~0; 1058#L220 assume ~id1~0 != ~id3~0; 1009#L221 assume ~id1~0 != ~id4~0; 1007#L222 assume ~id1~0 != ~id5~0; 1008#L223 assume ~id2~0 != ~id3~0; 998#L224 assume ~id2~0 != ~id4~0; 999#L225 assume ~id2~0 != ~id5~0; 993#L226 assume ~id3~0 != ~id4~0; 994#L227 assume ~id3~0 != ~id5~0; 1012#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 1013#L198-1 init_#res#1 := init_~tmp~0#1; 968#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 969#L24 assume !(0 == assume_abort_if_not_~cond#1); 1000#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1001#L395-2 [2022-02-21 04:29:56,045 INFO L793 eck$LassoCheckResult]: Loop: 1001#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1092#L73 assume !(0 != ~mode1~0 % 256); 1091#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1090#L87-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 1016#L73-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1089#L99 assume !(0 != ~mode2~0 % 256); 1085#L112 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 1084#L112-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 1082#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1081#L124 assume !(0 != ~mode3~0 % 256); 1077#L137 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 1076#L137-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 1057#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1024#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1025#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 983#L152-1 ~mode4~0 := 0; 990#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1047#L174 assume !(0 != ~mode5~0 % 256); 1056#L187 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1062#L187-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 1061#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1060#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1059#L332 assume !(~r1~0 % 256 >= 5); 1022#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 1023#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 1096#L331-1 check_#res#1 := check_~tmp~1#1; 1095#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 1094#L424 assume !(0 == assert_~arg#1 % 256); 1093#L419 assume { :end_inline_assert } true; 1001#L395-2 [2022-02-21 04:29:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2022-02-21 04:29:56,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:56,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689229646] [2022-02-21 04:29:56,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:56,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:56,097 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1079297777, now seen corresponding path program 1 times [2022-02-21 04:29:56,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:56,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947023430] [2022-02-21 04:29:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:56,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:56,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:56,134 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:56,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1416539613, now seen corresponding path program 1 times [2022-02-21 04:29:56,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:56,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246966204] [2022-02-21 04:29:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:56,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {1366#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {1366#true} is VALID [2022-02-21 04:29:56,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume 0 == ~r1~0 % 256; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {1366#true} assume ~id1~0 >= 0; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {1366#true} assume 0 == ~st1~0; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} assume ~send1~0 == ~id1~0; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {1366#true} assume 0 == ~mode1~0 % 256; {1366#true} is VALID [2022-02-21 04:29:56,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#true} assume ~id2~0 >= 0; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1366#true} assume 0 == ~st2~0; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {1366#true} assume ~send2~0 == ~id2~0; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {1366#true} assume 0 == ~mode2~0 % 256; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#true} assume ~id3~0 >= 0; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1366#true} assume 0 == ~st3~0; {1366#true} is VALID [2022-02-21 04:29:56,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {1366#true} assume ~send3~0 == ~id3~0; {1366#true} is VALID [2022-02-21 04:29:56,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1366#true} assume 0 == ~mode3~0 % 256; {1366#true} is VALID [2022-02-21 04:29:56,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {1366#true} assume ~id4~0 >= 0; {1366#true} is VALID [2022-02-21 04:29:56,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1366#true} assume 0 == ~st4~0; {1366#true} is VALID [2022-02-21 04:29:56,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1366#true} assume ~send4~0 == ~id4~0; {1366#true} is VALID [2022-02-21 04:29:56,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {1366#true} assume 0 == ~mode4~0 % 256; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:29:56,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {1368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1367#false} is VALID [2022-02-21 04:29:56,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {1367#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1367#false} is VALID [2022-02-21 04:29:56,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {1367#false} ~mode4~0 := 0; {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {1367#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {1367#false} assume !(0 != ~mode5~0 % 256); {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {1367#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {1367#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {1367#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1367#false} is VALID [2022-02-21 04:29:56,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {1367#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {1367#false} assume !(~r1~0 % 256 >= 5); {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {1367#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {1367#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {1367#false} check_#res#1 := check_~tmp~1#1; {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {1367#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {1367#false} assume !(0 == assert_~arg#1 % 256); {1367#false} is VALID [2022-02-21 04:29:56,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {1367#false} assume { :end_inline_assert } true; {1367#false} is VALID [2022-02-21 04:29:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:56,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:56,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246966204] [2022-02-21 04:29:56,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246966204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:56,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:56,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:29:56,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937733399] [2022-02-21 04:29:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:57,189 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:29:57,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:29:57,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:29:57,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:29:57,190 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:29:57,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:57,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:29:57,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:29:57,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:29:57,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:29:57,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:29:57,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:57,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:58,294 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12