./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_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.7_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 de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:32,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:32,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:32,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:32,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:33,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:33,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:33,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:33,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:33,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:33,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:33,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:33,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:33,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:33,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:33,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:33,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:33,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:33,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:33,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:33,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:33,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:33,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:33,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:33,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:33,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:33,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:33,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:33,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:33,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:33,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:33,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:33,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:33,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:33,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:33,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:33,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:33,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:33,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:33,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:33,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:33,035 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:30:33,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:33,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:33,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:33,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:33,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:33,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:33,062 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:33,062 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:33,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:33,062 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:33,063 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:33,063 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:33,063 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:33,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:33,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:33,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:33,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:33,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:33,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:33,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:33,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:33,066 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 -> de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d [2022-02-21 04:30:33,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:33,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:33,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:33,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:33,265 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:33,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:33,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0547019d6/f38b80959b524ff7b60767bc27c99e17/FLAGdefb0b03d [2022-02-21 04:30:33,687 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:33,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:33,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0547019d6/f38b80959b524ff7b60767bc27c99e17/FLAGdefb0b03d [2022-02-21 04:30:34,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0547019d6/f38b80959b524ff7b60767bc27c99e17 [2022-02-21 04:30:34,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:34,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:34,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:34,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:34,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:34,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62480cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34, skipping insertion in model container [2022-02-21 04:30:34,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:34,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:34,338 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.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2022-02-21 04:30:34,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:34,345 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:34,382 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.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2022-02-21 04:30:34,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:34,399 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:34,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34 WrapperNode [2022-02-21 04:30:34,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:34,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:34,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:34,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:34,405 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:30:34" (1/1) ... [2022-02-21 04:30:34,412 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:30:34" (1/1) ... [2022-02-21 04:30:34,449 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 426 [2022-02-21 04:30:34,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:34,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:34,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:34,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:34,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:34,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:34,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:34,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:34,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (1/1) ... [2022-02-21 04:30:34,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,512 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:30:34,517 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:30:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:34,646 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:34,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:35,028 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:35,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:35,033 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:35,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:35 BoogieIcfgContainer [2022-02-21 04:30:35,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:35,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:35,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:35,041 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:35,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:35,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:34" (1/3) ... [2022-02-21 04:30:35,043 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e879b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:35, skipping insertion in model container [2022-02-21 04:30:35,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:35,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:34" (2/3) ... [2022-02-21 04:30:35,044 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e879b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:35, skipping insertion in model container [2022-02-21 04:30:35,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:35,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:35" (3/3) ... [2022-02-21 04:30:35,046 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:35,092 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:35,092 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:35,092 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:35,092 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:35,092 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:35,093 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:35,093 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:35,093 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:35,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:30:35,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-02-21 04:30:35,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:35,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:35,148 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:35,148 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, 1, 1, 1, 1, 1] [2022-02-21 04:30:35,148 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:35,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:30:35,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-02-21 04:30:35,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:35,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:35,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:35,173 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, 1, 1, 1, 1, 1] [2022-02-21 04:30:35,178 INFO L791 eck$LassoCheckResult]: Stem: 116#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 41#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 60#L262true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 27#L262-1true init_#res#1 := init_~tmp~0#1; 42#L463true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 51#L24true assume !(0 == assume_abort_if_not_~cond#1); 17#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 54#L547-2true [2022-02-21 04:30:35,180 INFO L793 eck$LassoCheckResult]: Loop: 54#L547-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; 59#L87true assume !(0 != ~mode1~0 % 256); 117#L101true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 90#L101-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; 7#L87-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; 110#L113true assume !(0 != ~mode2~0 % 256); 78#L126true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 126#L126-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; 48#L113-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; 68#L138true assume !(0 != ~mode3~0 % 256); 86#L151true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 24#L151-2true ~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; 95#L138-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; 55#L163true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 96#L166true assume !(node4_~m4~0#1 != ~nomsg~0); 84#L166-1true ~mode4~0 := 0; 49#L163-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; 19#L188true assume !(0 != ~mode5~0 % 256); 69#L201true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; 111#L201-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; 10#L188-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 119#L213true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 104#L216true assume !(node6_~m6~0#1 != ~nomsg~0); 63#L216-1true ~mode6~0 := 0; 15#L213-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 28#L238true assume !(0 != ~mode7~0 % 256); 85#L251true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 53#L251-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 100#L238-2true assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 26#L471true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 106#L471-1true check_#res#1 := check_~tmp~1#1; 6#L491true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 124#L582true assume !(0 == assert_~arg#1 % 256); 73#L577true assume { :end_inline_assert } true; 54#L547-2true [2022-02-21 04:30:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2022-02-21 04:30:35,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:35,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304233250] [2022-02-21 04:30:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:35,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; {131#true} is VALID [2022-02-21 04:30:35,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {131#true} is VALID [2022-02-21 04:30:35,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {133#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:35,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {134#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:35,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {135#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:35,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {132#false} is VALID [2022-02-21 04:30:35,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {132#false} is VALID [2022-02-21 04:30:35,364 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:30:35,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:35,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304233250] [2022-02-21 04:30:35,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304233250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:35,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:35,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:35,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971175778] [2022-02-21 04:30:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:35,370 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1084182832, now seen corresponding path program 1 times [2022-02-21 04:30:35,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:35,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652732002] [2022-02-21 04:30:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:35,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume !(0 != ~mode1~0 % 256); {136#true} is VALID [2022-02-21 04:30:35,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {136#true} is VALID [2022-02-21 04:30:35,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} assume !(0 != ~mode2~0 % 256); {136#true} is VALID [2022-02-21 04:30:35,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {136#true} is VALID [2022-02-21 04:30:35,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#true} assume !(0 != ~mode3~0 % 256); {136#true} is VALID [2022-02-21 04:30:35,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {136#true} is VALID [2022-02-21 04:30:35,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {136#true} ~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; {136#true} is VALID [2022-02-21 04:30:35,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {136#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:35,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {136#true} assume !(node4_~m4~0#1 != ~nomsg~0); {136#true} is VALID [2022-02-21 04:30:35,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {136#true} ~mode4~0 := 0; {136#true} is VALID [2022-02-21 04:30:35,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {136#true} assume !(0 != ~mode5~0 % 256); {136#true} is VALID [2022-02-21 04:30:35,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {136#true} assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; {136#true} is VALID [2022-02-21 04:30:35,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {136#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; {136#true} is VALID [2022-02-21 04:30:35,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {136#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:35,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {136#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {136#true} assume !(node6_~m6~0#1 != ~nomsg~0); {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {136#true} ~mode6~0 := 0; {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {136#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {136#true} assume !(0 != ~mode7~0 % 256); {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {136#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {136#true} is VALID [2022-02-21 04:30:35,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {136#true} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {136#true} is VALID [2022-02-21 04:30:35,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {136#true} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {136#true} is VALID [2022-02-21 04:30:35,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {136#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {138#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:35,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {138#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {139#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:35,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {139#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {140#(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:30:35,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {140#(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); {137#false} is VALID [2022-02-21 04:30:35,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {137#false} assume { :end_inline_assert } true; {137#false} is VALID [2022-02-21 04:30:35,538 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:30:35,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:35,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652732002] [2022-02-21 04:30:35,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652732002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:35,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:35,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:35,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608042854] [2022-02-21 04:30:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:35,545 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:35,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:35,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:35,568 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:30:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:35,945 INFO L93 Difference]: Finished difference Result 126 states and 215 transitions. [2022-02-21 04:30:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:35,947 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:30:35,955 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:30:35,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 215 transitions. [2022-02-21 04:30:35,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:35,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 122 states and 162 transitions. [2022-02-21 04:30:35,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-02-21 04:30:35,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-02-21 04:30:35,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2022-02-21 04:30:35,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:35,983 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2022-02-21 04:30:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-21 04:30:36,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:36,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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:30:36,008 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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:30:36,009 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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:30:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,013 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2022-02-21 04:30:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:36,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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 122 states and 162 transitions. [2022-02-21 04:30:36,014 INFO L87 Difference]: Start difference. First operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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 122 states and 162 transitions. [2022-02-21 04:30:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,017 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2022-02-21 04:30:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:36,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:36,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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:30:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2022-02-21 04:30:36,021 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:36,021 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:36,021 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:36,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:36,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:36,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:36,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:36,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,023 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, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,024 INFO L791 eck$LassoCheckResult]: Stem: 391#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 337#L262 assume 0 == ~r1~0 % 256; 358#L263 assume ~id1~0 >= 0; 361#L264 assume 0 == ~st1~0; 362#L265 assume ~send1~0 == ~id1~0; 292#L266 assume 0 == ~mode1~0 % 256; 293#L267 assume ~id2~0 >= 0; 305#L268 assume 0 == ~st2~0; 306#L269 assume ~send2~0 == ~id2~0; 286#L270 assume 0 == ~mode2~0 % 256; 287#L271 assume ~id3~0 >= 0; 330#L272 assume 0 == ~st3~0; 340#L273 assume ~send3~0 == ~id3~0; 360#L274 assume 0 == ~mode3~0 % 256; 384#L275 assume ~id4~0 >= 0; 271#L276 assume 0 == ~st4~0; 272#L277 assume ~send4~0 == ~id4~0; 392#L278 assume 0 == ~mode4~0 % 256; 355#L279 assume ~id5~0 >= 0; 356#L280 assume 0 == ~st5~0; 298#L281 assume ~send5~0 == ~id5~0; 273#L282 assume 0 == ~mode5~0 % 256; 274#L283 assume ~id6~0 >= 0; 363#L284 assume 0 == ~st6~0; 364#L285 assume ~send6~0 == ~id6~0; 382#L286 assume 0 == ~mode6~0 % 256; 369#L287 assume ~id7~0 >= 0; 322#L288 assume 0 == ~st7~0; 323#L289 assume ~send7~0 == ~id7~0; 334#L290 assume 0 == ~mode7~0 % 256; 376#L291 assume ~id1~0 != ~id2~0; 377#L292 assume ~id1~0 != ~id3~0; 386#L293 assume ~id1~0 != ~id4~0; 390#L294 assume ~id1~0 != ~id5~0; 279#L295 assume ~id1~0 != ~id6~0; 280#L296 assume ~id1~0 != ~id7~0; 331#L297 assume ~id2~0 != ~id3~0; 328#L298 assume ~id2~0 != ~id4~0; 329#L299 assume ~id2~0 != ~id5~0; 335#L300 assume ~id2~0 != ~id6~0; 371#L301 assume ~id2~0 != ~id7~0; 380#L302 assume ~id3~0 != ~id4~0; 381#L303 assume ~id3~0 != ~id5~0; 388#L304 assume ~id3~0 != ~id6~0; 365#L305 assume ~id3~0 != ~id7~0; 366#L306 assume ~id4~0 != ~id5~0; 375#L307 assume ~id4~0 != ~id6~0; 288#L308 assume ~id4~0 != ~id7~0; 289#L309 assume ~id5~0 != ~id6~0; 374#L310 assume ~id5~0 != ~id7~0; 349#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 318#L262-1 init_#res#1 := init_~tmp~0#1; 319#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 338#L24 assume !(0 == assume_abort_if_not_~cond#1); 296#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 297#L547-2 [2022-02-21 04:30:36,024 INFO L793 eck$LassoCheckResult]: Loop: 297#L547-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; 352#L87 assume !(0 != ~mode1~0 % 256); 357#L101 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 383#L101-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; 277#L87-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; 278#L113 assume !(0 != ~mode2~0 % 256); 372#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 373#L126-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; 346#L113-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; 347#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 343#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 344#L141-1 ~mode3~0 := 0; 314#L138-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; 353#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 354#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 303#L166-1 ~mode4~0 := 0; 348#L163-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; 299#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 300#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 378#L191-1 ~mode5~0 := 0; 284#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 285#L213 assume !(0 != ~mode6~0 % 256); 290#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 291#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 294#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 295#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 320#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 325#L241-1 ~mode7~0 := 0; 351#L238-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 315#L471 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 316#L471-1 check_#res#1 := check_~tmp~1#1; 275#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 276#L582 assume !(0 == assert_~arg#1 % 256); 370#L577 assume { :end_inline_assert } true; 297#L547-2 [2022-02-21 04:30:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2022-02-21 04:30:36,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653835513] [2022-02-21 04:30:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,117 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1396560678, now seen corresponding path program 1 times [2022-02-21 04:30:36,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720415903] [2022-02-21 04:30:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:36,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} assume !(0 != ~mode1~0 % 256); {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} assume !(0 != ~mode2~0 % 256); {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#true} assume !(node3_~m3~0#1 != ~nomsg~0); {642#true} is VALID [2022-02-21 04:30:36,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#true} ~mode3~0 := 0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#true} assume !(node4_~m4~0#1 != ~nomsg~0); {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#true} ~mode4~0 := 0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#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; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {642#true} assume !(node5_~m5~0#1 != ~nomsg~0); {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#true} ~mode5~0 := 0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {642#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {642#true} assume !(0 != ~mode6~0 % 256); {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {642#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {642#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {642#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {642#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {642#true} assume !(node7_~m7~0#1 != ~nomsg~0); {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#true} ~mode7~0 := 0; {642#true} is VALID [2022-02-21 04:30:36,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {642#true} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {642#true} is VALID [2022-02-21 04:30:36,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {642#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {644#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:36,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {644#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {645#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:36,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {645#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {646#(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:30:36,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {646#(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); {643#false} is VALID [2022-02-21 04:30:36,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {643#false} assume { :end_inline_assert } true; {643#false} is VALID [2022-02-21 04:30:36,201 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:30:36,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:36,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720415903] [2022-02-21 04:30:36,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720415903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:36,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:36,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:36,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235543330] [2022-02-21 04:30:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:36,202 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:36,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:36,203 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:30:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,489 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2022-02-21 04:30:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:36,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:30:36,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:36,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2022-02-21 04:30:36,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:36,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2022-02-21 04:30:36,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-02-21 04:30:36,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-02-21 04:30:36,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2022-02-21 04:30:36,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:36,520 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2022-02-21 04:30:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-21 04:30:36,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:36,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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:30:36,524 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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:30:36,524 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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:30:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,526 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2022-02-21 04:30:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:36,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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 122 states and 159 transitions. [2022-02-21 04:30:36,527 INFO L87 Difference]: Start difference. First operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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 122 states and 159 transitions. [2022-02-21 04:30:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,530 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2022-02-21 04:30:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:36,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:36,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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:30:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2022-02-21 04:30:36,532 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:36,532 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:36,532 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:36,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:36,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:36,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:36,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:36,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,534 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,534 INFO L791 eck$LassoCheckResult]: Stem: 896#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 840#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 841#L262 assume 0 == ~r1~0 % 256; 863#L263 assume ~id1~0 >= 0; 866#L264 assume 0 == ~st1~0; 867#L265 assume ~send1~0 == ~id1~0; 797#L266 assume 0 == ~mode1~0 % 256; 798#L267 assume ~id2~0 >= 0; 810#L268 assume 0 == ~st2~0; 811#L269 assume ~send2~0 == ~id2~0; 791#L270 assume 0 == ~mode2~0 % 256; 792#L271 assume ~id3~0 >= 0; 834#L272 assume 0 == ~st3~0; 845#L273 assume ~send3~0 == ~id3~0; 865#L274 assume 0 == ~mode3~0 % 256; 889#L275 assume ~id4~0 >= 0; 776#L276 assume 0 == ~st4~0; 777#L277 assume ~send4~0 == ~id4~0; 897#L278 assume 0 == ~mode4~0 % 256; 860#L279 assume ~id5~0 >= 0; 861#L280 assume 0 == ~st5~0; 803#L281 assume ~send5~0 == ~id5~0; 778#L282 assume 0 == ~mode5~0 % 256; 779#L283 assume ~id6~0 >= 0; 868#L284 assume 0 == ~st6~0; 869#L285 assume ~send6~0 == ~id6~0; 887#L286 assume 0 == ~mode6~0 % 256; 874#L287 assume ~id7~0 >= 0; 826#L288 assume 0 == ~st7~0; 827#L289 assume ~send7~0 == ~id7~0; 836#L290 assume 0 == ~mode7~0 % 256; 881#L291 assume ~id1~0 != ~id2~0; 882#L292 assume ~id1~0 != ~id3~0; 891#L293 assume ~id1~0 != ~id4~0; 895#L294 assume ~id1~0 != ~id5~0; 784#L295 assume ~id1~0 != ~id6~0; 785#L296 assume ~id1~0 != ~id7~0; 835#L297 assume ~id2~0 != ~id3~0; 832#L298 assume ~id2~0 != ~id4~0; 833#L299 assume ~id2~0 != ~id5~0; 839#L300 assume ~id2~0 != ~id6~0; 876#L301 assume ~id2~0 != ~id7~0; 885#L302 assume ~id3~0 != ~id4~0; 886#L303 assume ~id3~0 != ~id5~0; 893#L304 assume ~id3~0 != ~id6~0; 870#L305 assume ~id3~0 != ~id7~0; 871#L306 assume ~id4~0 != ~id5~0; 880#L307 assume ~id4~0 != ~id6~0; 793#L308 assume ~id4~0 != ~id7~0; 794#L309 assume ~id5~0 != ~id6~0; 879#L310 assume ~id5~0 != ~id7~0; 854#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 822#L262-1 init_#res#1 := init_~tmp~0#1; 823#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 842#L24 assume !(0 == assume_abort_if_not_~cond#1); 801#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 802#L547-2 [2022-02-21 04:30:36,534 INFO L793 eck$LassoCheckResult]: Loop: 802#L547-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; 857#L87 assume !(0 != ~mode1~0 % 256); 862#L101 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 888#L101-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; 782#L87-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; 783#L113 assume !(0 != ~mode2~0 % 256); 877#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 878#L126-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; 851#L113-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; 852#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 848#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 849#L141-1 ~mode3~0 := 0; 819#L138-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; 858#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 859#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 808#L166-1 ~mode4~0 := 0; 853#L163-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; 804#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 805#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 883#L191-1 ~mode5~0 := 0; 789#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 790#L213 assume !(0 != ~mode6~0 % 256); 795#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 796#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 799#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 800#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 824#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 829#L241-1 ~mode7~0 := 0; 856#L238-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 820#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 821#L472 assume ~r1~0 % 256 >= 7; 838#L476 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 843#L471-1 check_#res#1 := check_~tmp~1#1; 780#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 781#L582 assume !(0 == assert_~arg#1 % 256); 875#L577 assume { :end_inline_assert } true; 802#L547-2 [2022-02-21 04:30:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2022-02-21 04:30:36,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35330745] [2022-02-21 04:30:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,597 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 649202326, now seen corresponding path program 1 times [2022-02-21 04:30:36,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408319190] [2022-02-21 04:30:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:36,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1147#true} assume !(0 != ~mode1~0 % 256); {1147#true} is VALID [2022-02-21 04:30:36,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1147#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1147#true} is VALID [2022-02-21 04:30:36,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {1147#true} assume !(0 != ~mode2~0 % 256); {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {1147#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1147#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {1147#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#true} ~mode3~0 := 0; {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1147#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#true} assume !(node4_~m4~0#1 != ~nomsg~0); {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#true} ~mode4~0 := 0; {1147#true} is VALID [2022-02-21 04:30:36,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#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; {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#true} ~mode5~0 := 0; {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#true} assume !(0 != ~mode6~0 % 256); {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1147#true} is VALID [2022-02-21 04:30:36,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#true} assume !(node7_~m7~0#1 != ~nomsg~0); {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {1147#true} ~mode7~0 := 0; {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {1147#true} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1147#true} is VALID [2022-02-21 04:30:36,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {1147#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1147#true} is VALID [2022-02-21 04:30:36,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {1147#true} assume ~r1~0 % 256 >= 7; {1149#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 6)))} is VALID [2022-02-21 04:30:36,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {1149#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 6)))} assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; {1148#false} is VALID [2022-02-21 04:30:36,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {1148#false} check_#res#1 := check_~tmp~1#1; {1148#false} is VALID [2022-02-21 04:30:36,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {1148#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1148#false} is VALID [2022-02-21 04:30:36,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {1148#false} assume !(0 == assert_~arg#1 % 256); {1148#false} is VALID [2022-02-21 04:30:36,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {1148#false} assume { :end_inline_assert } true; {1148#false} is VALID [2022-02-21 04:30:36,647 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:30:36,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:36,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408319190] [2022-02-21 04:30:36,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408319190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:36,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:36,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:36,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622856576] [2022-02-21 04:30:36,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:36,648 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:36,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:36,649 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:30:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,816 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:36,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:30:36,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:36,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-02-21 04:30:36,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2022-02-21 04:30:36,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2022-02-21 04:30:36,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2022-02-21 04:30:36,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:36,848 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-21 04:30:36,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:36,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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:30:36,853 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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:30:36,854 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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:30:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,857 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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 182 states and 251 transitions. [2022-02-21 04:30:36,858 INFO L87 Difference]: Start difference. First operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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 182 states and 251 transitions. [2022-02-21 04:30:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:36,861 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:36,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:36,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:36,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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:30:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-02-21 04:30:36,865 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:36,865 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:36,865 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:36,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:36,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-02-21 04:30:36,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:36,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:36,867 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,867 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,867 INFO L791 eck$LassoCheckResult]: Stem: 1455#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 1396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1397#L262 assume 0 == ~r1~0 % 256; 1420#L263 assume ~id1~0 >= 0; 1423#L264 assume 0 == ~st1~0; 1424#L265 assume ~send1~0 == ~id1~0; 1355#L266 assume 0 == ~mode1~0 % 256; 1356#L267 assume ~id2~0 >= 0; 1369#L268 assume 0 == ~st2~0; 1370#L269 assume ~send2~0 == ~id2~0; 1347#L270 assume 0 == ~mode2~0 % 256; 1348#L271 assume ~id3~0 >= 0; 1390#L272 assume 0 == ~st3~0; 1400#L273 assume ~send3~0 == ~id3~0; 1422#L274 assume 0 == ~mode3~0 % 256; 1448#L275 assume ~id4~0 >= 0; 1332#L276 assume 0 == ~st4~0; 1333#L277 assume ~send4~0 == ~id4~0; 1456#L278 assume 0 == ~mode4~0 % 256; 1417#L279 assume ~id5~0 >= 0; 1418#L280 assume 0 == ~st5~0; 1359#L281 assume ~send5~0 == ~id5~0; 1334#L282 assume 0 == ~mode5~0 % 256; 1335#L283 assume ~id6~0 >= 0; 1425#L284 assume 0 == ~st6~0; 1426#L285 assume ~send6~0 == ~id6~0; 1446#L286 assume 0 == ~mode6~0 % 256; 1431#L287 assume ~id7~0 >= 0; 1382#L288 assume 0 == ~st7~0; 1383#L289 assume ~send7~0 == ~id7~0; 1393#L290 assume 0 == ~mode7~0 % 256; 1440#L291 assume ~id1~0 != ~id2~0; 1441#L292 assume ~id1~0 != ~id3~0; 1450#L293 assume ~id1~0 != ~id4~0; 1454#L294 assume ~id1~0 != ~id5~0; 1340#L295 assume ~id1~0 != ~id6~0; 1341#L296 assume ~id1~0 != ~id7~0; 1391#L297 assume ~id2~0 != ~id3~0; 1388#L298 assume ~id2~0 != ~id4~0; 1389#L299 assume ~id2~0 != ~id5~0; 1395#L300 assume ~id2~0 != ~id6~0; 1433#L301 assume ~id2~0 != ~id7~0; 1444#L302 assume ~id3~0 != ~id4~0; 1445#L303 assume ~id3~0 != ~id5~0; 1452#L304 assume ~id3~0 != ~id6~0; 1427#L305 assume ~id3~0 != ~id7~0; 1428#L306 assume ~id4~0 != ~id5~0; 1439#L307 assume ~id4~0 != ~id6~0; 1351#L308 assume ~id4~0 != ~id7~0; 1352#L309 assume ~id5~0 != ~id6~0; 1438#L310 assume ~id5~0 != ~id7~0; 1410#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 1380#L262-1 init_#res#1 := init_~tmp~0#1; 1381#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 1398#L24 assume !(0 == assume_abort_if_not_~cond#1); 1357#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1358#L547-2 [2022-02-21 04:30:36,868 INFO L793 eck$LassoCheckResult]: Loop: 1358#L547-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; 1509#L87 assume !(0 != ~mode1~0 % 256); 1508#L101 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1507#L101-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; 1394#L87-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; 1506#L113 assume !(0 != ~mode2~0 % 256); 1505#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 1500#L126-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; 1499#L113-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; 1498#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1495#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 1493#L141-1 ~mode3~0 := 0; 1491#L138-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; 1490#L163 assume !(0 != ~mode4~0 % 256); 1489#L176 assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; 1484#L176-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; 1483#L163-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; 1482#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1479#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 1477#L191-1 ~mode5~0 := 0; 1475#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1474#L213 assume !(0 != ~mode6~0 % 256); 1473#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 1468#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 1467#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 1466#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1464#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 1461#L241-1 ~mode7~0 := 0; 1459#L238-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1458#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 1457#L472 assume !(~r1~0 % 256 >= 7); 1436#L475 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 1437#L476 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 1513#L471-1 check_#res#1 := check_~tmp~1#1; 1512#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1511#L582 assume !(0 == assert_~arg#1 % 256); 1510#L577 assume { :end_inline_assert } true; 1358#L547-2 [2022-02-21 04:30:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2022-02-21 04:30:36,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677526806] [2022-02-21 04:30:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,920 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 407181051, now seen corresponding path program 1 times [2022-02-21 04:30:36,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348626700] [2022-02-21 04:30:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:36,976 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1245553782, now seen corresponding path program 1 times [2022-02-21 04:30:36,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560309979] [2022-02-21 04:30:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:37,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {1885#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; {1885#true} is VALID [2022-02-21 04:30:37,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1885#true} is VALID [2022-02-21 04:30:37,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume 0 == ~r1~0 % 256; {1885#true} is VALID [2022-02-21 04:30:37,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {1885#true} assume ~id1~0 >= 0; {1885#true} is VALID [2022-02-21 04:30:37,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {1885#true} assume 0 == ~st1~0; {1885#true} is VALID [2022-02-21 04:30:37,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} assume ~send1~0 == ~id1~0; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1885#true} assume 0 == ~mode1~0 % 256; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1885#true} assume ~id2~0 >= 0; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1885#true} assume 0 == ~st2~0; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1885#true} assume ~send2~0 == ~id2~0; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {1885#true} assume 0 == ~mode2~0 % 256; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#true} assume ~id3~0 >= 0; {1885#true} is VALID [2022-02-21 04:30:37,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {1885#true} assume 0 == ~st3~0; {1885#true} is VALID [2022-02-21 04:30:37,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {1885#true} assume ~send3~0 == ~id3~0; {1885#true} is VALID [2022-02-21 04:30:37,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {1885#true} assume 0 == ~mode3~0 % 256; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {1887#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {1886#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {1886#false} ~mode3~0 := 0; {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {1886#false} 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; {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {1886#false} assume !(0 != ~mode4~0 % 256); {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {1886#false} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {1886#false} ~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; {1886#false} is VALID [2022-02-21 04:30:37,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {1886#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; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {1886#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {1886#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 75: Hoare triple {1886#false} ~mode5~0 := 0; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 76: Hoare triple {1886#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {1886#false} assume !(0 != ~mode6~0 % 256); {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {1886#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {1886#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1886#false} is VALID [2022-02-21 04:30:37,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {1886#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {1886#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {1886#false} assume !(node7_~m7~0#1 != ~nomsg~0); {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {1886#false} ~mode7~0 := 0; {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {1886#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {1886#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {1886#false} assume !(~r1~0 % 256 >= 7); {1886#false} is VALID [2022-02-21 04:30:37,066 INFO L290 TraceCheckUtils]: 87: Hoare triple {1886#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; {1886#false} is VALID [2022-02-21 04:30:37,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {1886#false} assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; {1886#false} is VALID [2022-02-21 04:30:37,067 INFO L290 TraceCheckUtils]: 89: Hoare triple {1886#false} check_#res#1 := check_~tmp~1#1; {1886#false} is VALID [2022-02-21 04:30:37,067 INFO L290 TraceCheckUtils]: 90: Hoare triple {1886#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1886#false} is VALID [2022-02-21 04:30:37,067 INFO L290 TraceCheckUtils]: 91: Hoare triple {1886#false} assume !(0 == assert_~arg#1 % 256); {1886#false} is VALID [2022-02-21 04:30:37,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {1886#false} assume { :end_inline_assert } true; {1886#false} is VALID [2022-02-21 04:30:37,068 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:30:37,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:37,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560309979] [2022-02-21 04:30:37,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560309979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:37,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:37,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:37,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137029439] [2022-02-21 04:30:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:38,423 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:38,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:38,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:38,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:38,423 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:38,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:38,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:38,423 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:30:38,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:38,424 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:38,444 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:30:38,450 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:30:38,451 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:30:38,455 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:30:38,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:30:38,461 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:30:38,462 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:30:38,465 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:30:38,467 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:30:38,469 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:30:38,471 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:30:38,474 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:30:38,475 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:30:38,478 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:30:38,729 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:30:38,733 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:30:38,737 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:30:38,739 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:30:38,742 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:30:38,744 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:30:39,716 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12