./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_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.4_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 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:29:39,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:29:39,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:29:39,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:29:39,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:29:39,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:29:39,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:29:39,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:29:39,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:29:39,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:29:39,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:29:39,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:29:39,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:29:39,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:29:39,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:29:39,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:29:39,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:29:39,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:29:39,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:29:39,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:29:39,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:29:39,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:29:39,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:29:39,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:29:39,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:29:39,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:29:39,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:29:39,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:29:39,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:29:39,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:29:39,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:29:39,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:29:39,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:29:39,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:29:39,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:29:39,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:29:39,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:29:39,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:29:39,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:29:39,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:29:39,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:29:39,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:29:39,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:29:39,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:29:39,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:29:39,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:29:39,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:29:39,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:29:39,560 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:29:39,561 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:29:39,561 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:29:39,561 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:29:39,562 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:29:39,562 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:29:39,562 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:29:39,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:29:39,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:29:39,563 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:29:39,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:29:39,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:29:39,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:29:39,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:29:39,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:29:39,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:29:39,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:29:39,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:29:39,565 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:29:39,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:29:39,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:29:39,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:29:39,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:29:39,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:29:39,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:29:39,567 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:29:39,567 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 -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2022-02-21 04:29:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:29:39,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:29:39,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:29:39,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:29:39,796 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:29:39,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:39,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50b59f40/95c7b2aa025c43888963b1c6531110ec/FLAG3d96f5738 [2022-02-21 04:29:40,276 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:29:40,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:40,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50b59f40/95c7b2aa025c43888963b1c6531110ec/FLAG3d96f5738 [2022-02-21 04:29:40,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50b59f40/95c7b2aa025c43888963b1c6531110ec [2022-02-21 04:29:40,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:29:40,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:29:40,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:40,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:29:40,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:29:40,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:40" (1/1) ... [2022-02-21 04:29:40,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237da233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:40, skipping insertion in model container [2022-02-21 04:29:40,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:40" (1/1) ... [2022-02-21 04:29:40,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:29:40,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:29:40,962 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.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-02-21 04:29:40,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:40,970 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:29:41,025 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.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-02-21 04:29:41,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:41,057 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:29:41,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41 WrapperNode [2022-02-21 04:29:41,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:41,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:41,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:29:41,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:29:41,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,142 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 258 [2022-02-21 04:29:41,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:41,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:29:41,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:29:41,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:29:41,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:29:41,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:29:41,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:29:41,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:29:41,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (1/1) ... [2022-02-21 04:29:41,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:41,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:41,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:29:41,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:29:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:29:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:29:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:29:41,387 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:29:41,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:29:41,725 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:29:41,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:29:41,731 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:29:41,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:41 BoogieIcfgContainer [2022-02-21 04:29:41,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:29:41,734 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:29:41,734 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:29:41,738 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:29:41,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:41,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:29:40" (1/3) ... [2022-02-21 04:29:41,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e92342b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:41, skipping insertion in model container [2022-02-21 04:29:41,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:41,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:41" (2/3) ... [2022-02-21 04:29:41,740 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e92342b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:41, skipping insertion in model container [2022-02-21 04:29:41,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:41,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:41" (3/3) ... [2022-02-21 04:29:41,741 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:29:41,781 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:29:41,781 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:29:41,782 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:29:41,782 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:29:41,782 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:29:41,782 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:29:41,782 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:29:41,782 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:29:41,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:41,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-02-21 04:29:41,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:41,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:41,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:41,863 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] [2022-02-21 04:29:41,863 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:29:41,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:41,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-02-21 04:29:41,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:41,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:41,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:41,885 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] [2022-02-21 04:29:41,892 INFO L791 eck$LassoCheckResult]: Stem: 61#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; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 26#L166true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 14#L166-1true init_#res#1 := init_~tmp~0#1; 5#L259true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 60#L24true assume !(0 == assume_abort_if_not_~cond#1); 15#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;main_~i2~0#1 := 0; 42#L325-2true [2022-02-21 04:29:41,898 INFO L793 eck$LassoCheckResult]: Loop: 42#L325-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; 44#L66true assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 75#L70true assume !(node1_~m1~0#1 != ~nomsg~0); 30#L70-1true ~mode1~0 := 0; 50#L66-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; 52#L92true assume !(0 != ~mode2~0 % 256); 19#L105true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 51#L105-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; 71#L92-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; 11#L117true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 57#L120true assume !(node3_~m3~0#1 != ~nomsg~0); 58#L120-1true ~mode3~0 := 0; 25#L117-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; 40#L142true assume !(0 != ~mode4~0 % 256); 59#L155true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 36#L155-2true ~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; 32#L142-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 27#L267true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 45#L267-1true check_#res#1 := check_~tmp~1#1; 73#L287true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 6#L351true assume !(0 == assert_~arg#1 % 256); 56#L346true assume { :end_inline_assert } true; 42#L325-2true [2022-02-21 04:29:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-02-21 04:29:41,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:41,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801077989] [2022-02-21 04:29:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:42,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#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; {80#true} is VALID [2022-02-21 04:29:42,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80#true} is VALID [2022-02-21 04:29:42,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {82#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:29:42,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {83#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:29:42,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {83#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {84#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:29:42,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {81#false} is VALID [2022-02-21 04:29:42,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#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;main_~i2~0#1 := 0; {81#false} is VALID [2022-02-21 04:29:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:42,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:42,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801077989] [2022-02-21 04:29:42,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801077989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:42,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:42,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:42,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611020352] [2022-02-21 04:29:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:42,152 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:29:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1219507551, now seen corresponding path program 1 times [2022-02-21 04:29:42,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:42,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952343339] [2022-02-21 04:29:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:42,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#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; {85#true} is VALID [2022-02-21 04:29:42,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {85#true} is VALID [2022-02-21 04:29:42,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} assume !(node1_~m1~0#1 != ~nomsg~0); {85#true} is VALID [2022-02-21 04:29:42,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} ~mode1~0 := 0; {85#true} is VALID [2022-02-21 04:29:42,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#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; {85#true} is VALID [2022-02-21 04:29:42,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} assume !(0 != ~mode2~0 % 256); {85#true} is VALID [2022-02-21 04:29:42,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {85#true} is VALID [2022-02-21 04:29:42,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#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; {85#true} is VALID [2022-02-21 04:29:42,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {85#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; {85#true} is VALID [2022-02-21 04:29:42,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {85#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {85#true} is VALID [2022-02-21 04:29:42,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#true} assume !(node3_~m3~0#1 != ~nomsg~0); {85#true} is VALID [2022-02-21 04:29:42,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {85#true} ~mode3~0 := 0; {85#true} is VALID [2022-02-21 04:29:42,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {85#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; {85#true} is VALID [2022-02-21 04:29:42,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {85#true} assume !(0 != ~mode4~0 % 256); {85#true} is VALID [2022-02-21 04:29:42,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {85#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {85#true} is VALID [2022-02-21 04:29:42,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {85#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {85#true} is VALID [2022-02-21 04:29:42,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {85#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {85#true} is VALID [2022-02-21 04:29:42,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {85#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {87#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:42,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {87#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {88#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:42,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {88#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {89#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:29:42,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {89#(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); {86#false} is VALID [2022-02-21 04:29:42,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#false} assume { :end_inline_assert } true; {86#false} is VALID [2022-02-21 04:29:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:42,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:42,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952343339] [2022-02-21 04:29:42,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952343339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:42,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:42,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:42,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376647517] [2022-02-21 04:29:42,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:42,411 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:42,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:42,445 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:42,741 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2022-02-21 04:29:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:42,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:42,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 122 transitions. [2022-02-21 04:29:42,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-02-21 04:29:42,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 71 states and 96 transitions. [2022-02-21 04:29:42,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-02-21 04:29:42,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 04:29:42,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 96 transitions. [2022-02-21 04:29:42,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:42,769 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-02-21 04:29:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 96 transitions. [2022-02-21 04:29:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 04:29:42,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:42,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 96 transitions. Second operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,795 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 96 transitions. Second operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,797 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:42,801 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-02-21 04:29:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-02-21 04:29:42,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:42,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:42,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 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 71 states and 96 transitions. [2022-02-21 04:29:42,803 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 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 71 states and 96 transitions. [2022-02-21 04:29:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:42,806 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-02-21 04:29:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-02-21 04:29:42,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:42,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:42,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:42,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-02-21 04:29:42,812 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-02-21 04:29:42,812 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-02-21 04:29:42,812 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:29:42,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2022-02-21 04:29:42,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-02-21 04:29:42,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:42,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:42,814 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] [2022-02-21 04:29:42,815 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] [2022-02-21 04:29:42,815 INFO L791 eck$LassoCheckResult]: Stem: 235#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; 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 212#L166 assume 0 == ~r1~0 % 256; 203#L167 assume ~id1~0 >= 0; 181#L168 assume 0 == ~st1~0; 182#L169 assume ~send1~0 == ~id1~0; 239#L170 assume 0 == ~mode1~0 % 256; 233#L171 assume ~id2~0 >= 0; 229#L172 assume 0 == ~st2~0; 230#L173 assume ~send2~0 == ~id2~0; 237#L174 assume 0 == ~mode2~0 % 256; 177#L175 assume ~id3~0 >= 0; 178#L176 assume 0 == ~st3~0; 234#L177 assume ~send3~0 == ~id3~0; 218#L178 assume 0 == ~mode3~0 % 256; 219#L179 assume ~id4~0 >= 0; 169#L180 assume 0 == ~st4~0; 170#L181 assume ~send4~0 == ~id4~0; 215#L182 assume 0 == ~mode4~0 % 256; 217#L183 assume ~id1~0 != ~id2~0; 194#L184 assume ~id1~0 != ~id3~0; 195#L185 assume ~id1~0 != ~id4~0; 221#L186 assume ~id2~0 != ~id3~0; 236#L187 assume ~id2~0 != ~id4~0; 196#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 189#L166-1 init_#res#1 := init_~tmp~0#1; 173#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 174#L24 assume !(0 == assume_abort_if_not_~cond#1); 192#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;main_~i2~0#1 := 0; 193#L325-2 [2022-02-21 04:29:42,815 INFO L793 eck$LassoCheckResult]: Loop: 193#L325-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; 225#L66 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 226#L70 assume !(node1_~m1~0#1 != ~nomsg~0); 180#L70-1 ~mode1~0 := 0; 199#L66-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; 232#L92 assume !(0 != ~mode2~0 % 256); 197#L105 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 198#L105-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; 222#L92-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; 183#L117 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 184#L120 assume !(node3_~m3~0#1 != ~nomsg~0); 191#L120-1 ~mode3~0 := 0; 210#L117-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; 211#L142 assume !(0 != ~mode4~0 % 256); 224#L155 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 220#L155-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; 216#L142-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 213#L267 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 176#L267-1 check_#res#1 := check_~tmp~1#1; 227#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 171#L351 assume !(0 == assert_~arg#1 % 256); 172#L346 assume { :end_inline_assert } true; 193#L325-2 [2022-02-21 04:29:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:42,816 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-02-21 04:29:42,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:42,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407788624] [2022-02-21 04:29:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:42,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:42,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1219507551, now seen corresponding path program 2 times [2022-02-21 04:29:42,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:42,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809740455] [2022-02-21 04:29:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:42,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#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; {387#true} is VALID [2022-02-21 04:29:42,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {387#true} is VALID [2022-02-21 04:29:42,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} assume !(node1_~m1~0#1 != ~nomsg~0); {387#true} is VALID [2022-02-21 04:29:42,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#true} ~mode1~0 := 0; {387#true} is VALID [2022-02-21 04:29:42,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {387#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; {387#true} is VALID [2022-02-21 04:29:42,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {387#true} assume !(0 != ~mode2~0 % 256); {387#true} is VALID [2022-02-21 04:29:42,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {387#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {387#true} is VALID [2022-02-21 04:29:42,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#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; {387#true} is VALID [2022-02-21 04:29:42,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#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; {387#true} is VALID [2022-02-21 04:29:42,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {387#true} is VALID [2022-02-21 04:29:42,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {387#true} assume !(node3_~m3~0#1 != ~nomsg~0); {387#true} is VALID [2022-02-21 04:29:42,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#true} ~mode3~0 := 0; {387#true} is VALID [2022-02-21 04:29:42,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#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; {387#true} is VALID [2022-02-21 04:29:42,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {387#true} assume !(0 != ~mode4~0 % 256); {387#true} is VALID [2022-02-21 04:29:42,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {387#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {387#true} is VALID [2022-02-21 04:29:42,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {387#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {387#true} is VALID [2022-02-21 04:29:42,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {387#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {387#true} is VALID [2022-02-21 04:29:42,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {387#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {389#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:42,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {389#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {390#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:42,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {390#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {391#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:29:42,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {391#(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); {388#false} is VALID [2022-02-21 04:29:42,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {388#false} assume { :end_inline_assert } true; {388#false} is VALID [2022-02-21 04:29:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:42,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:42,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809740455] [2022-02-21 04:29:42,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809740455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:42,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:42,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:42,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230324129] [2022-02-21 04:29:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:42,988 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:42,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:42,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:42,990 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,241 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-02-21 04:29:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:43,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:43,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-02-21 04:29:43,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-02-21 04:29:43,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2022-02-21 04:29:43,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-02-21 04:29:43,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 04:29:43,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2022-02-21 04:29:43,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:43,273 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-02-21 04:29:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2022-02-21 04:29:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 04:29:43,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:43,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 93 transitions. Second operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,277 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 93 transitions. Second operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,277 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,280 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-02-21 04:29:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-02-21 04:29:43,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:43,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:43,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 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 71 states and 93 transitions. [2022-02-21 04:29:43,281 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 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 71 states and 93 transitions. [2022-02-21 04:29:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,283 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-02-21 04:29:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-02-21 04:29:43,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:43,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:43,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:43,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-02-21 04:29:43,287 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-02-21 04:29:43,287 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-02-21 04:29:43,287 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:29:43,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-02-21 04:29:43,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-02-21 04:29:43,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:43,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:43,289 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] [2022-02-21 04:29:43,289 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] [2022-02-21 04:29:43,290 INFO L791 eck$LassoCheckResult]: Stem: 536#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; 529#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 513#L166 assume 0 == ~r1~0 % 256; 501#L167 assume ~id1~0 >= 0; 480#L168 assume 0 == ~st1~0; 481#L169 assume ~send1~0 == ~id1~0; 540#L170 assume 0 == ~mode1~0 % 256; 533#L171 assume ~id2~0 >= 0; 530#L172 assume 0 == ~st2~0; 531#L173 assume ~send2~0 == ~id2~0; 538#L174 assume 0 == ~mode2~0 % 256; 478#L175 assume ~id3~0 >= 0; 479#L176 assume 0 == ~st3~0; 535#L177 assume ~send3~0 == ~id3~0; 519#L178 assume 0 == ~mode3~0 % 256; 520#L179 assume ~id4~0 >= 0; 470#L180 assume 0 == ~st4~0; 471#L181 assume ~send4~0 == ~id4~0; 516#L182 assume 0 == ~mode4~0 % 256; 518#L183 assume ~id1~0 != ~id2~0; 495#L184 assume ~id1~0 != ~id3~0; 496#L185 assume ~id1~0 != ~id4~0; 522#L186 assume ~id2~0 != ~id3~0; 537#L187 assume ~id2~0 != ~id4~0; 497#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 490#L166-1 init_#res#1 := init_~tmp~0#1; 472#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 473#L24 assume !(0 == assume_abort_if_not_~cond#1); 491#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;main_~i2~0#1 := 0; 492#L325-2 [2022-02-21 04:29:43,290 INFO L793 eck$LassoCheckResult]: Loop: 492#L325-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; 526#L66 assume !(0 != ~mode1~0 % 256); 488#L80 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 489#L80-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; 500#L66-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; 534#L92 assume !(0 != ~mode2~0 % 256); 498#L105 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 499#L105-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; 523#L92-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; 484#L117 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 485#L120 assume !(node3_~m3~0#1 != ~nomsg~0); 494#L120-1 ~mode3~0 := 0; 511#L117-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; 512#L142 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 524#L145 assume !(node4_~m4~0#1 != ~nomsg~0); 503#L145-1 ~mode4~0 := 0; 517#L142-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 514#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 508#L268 assume ~r1~0 % 256 >= 4; 509#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 477#L267-1 check_#res#1 := check_~tmp~1#1; 528#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 474#L351 assume !(0 == assert_~arg#1 % 256); 475#L346 assume { :end_inline_assert } true; 492#L325-2 [2022-02-21 04:29:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-02-21 04:29:43,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:43,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857648715] [2022-02-21 04:29:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,326 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:43,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:43,327 INFO L85 PathProgramCache]: Analyzing trace with hash 851750321, now seen corresponding path program 1 times [2022-02-21 04:29:43,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:43,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659911333] [2022-02-21 04:29:43,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:43,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:43,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#true} assume !(0 != ~mode1~0 % 256); {688#true} is VALID [2022-02-21 04:29:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {688#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {688#true} is VALID [2022-02-21 04:29:43,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {688#true} assume !(0 != ~mode2~0 % 256); {688#true} is VALID [2022-02-21 04:29:43,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {688#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {688#true} is VALID [2022-02-21 04:29:43,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {688#true} is VALID [2022-02-21 04:29:43,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {688#true} assume !(node3_~m3~0#1 != ~nomsg~0); {688#true} is VALID [2022-02-21 04:29:43,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {688#true} ~mode3~0 := 0; {688#true} is VALID [2022-02-21 04:29:43,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {688#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; {688#true} is VALID [2022-02-21 04:29:43,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {688#true} is VALID [2022-02-21 04:29:43,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#true} assume !(node4_~m4~0#1 != ~nomsg~0); {688#true} is VALID [2022-02-21 04:29:43,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {688#true} ~mode4~0 := 0; {688#true} is VALID [2022-02-21 04:29:43,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {688#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {688#true} is VALID [2022-02-21 04:29:43,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {688#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {688#true} is VALID [2022-02-21 04:29:43,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {688#true} assume ~r1~0 % 256 >= 4; {690#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} is VALID [2022-02-21 04:29:43,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {690#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {689#false} is VALID [2022-02-21 04:29:43,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#false} check_#res#1 := check_~tmp~1#1; {689#false} is VALID [2022-02-21 04:29:43,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {689#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {689#false} is VALID [2022-02-21 04:29:43,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {689#false} assume !(0 == assert_~arg#1 % 256); {689#false} is VALID [2022-02-21 04:29:43,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {689#false} assume { :end_inline_assert } true; {689#false} is VALID [2022-02-21 04:29:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:43,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:43,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659911333] [2022-02-21 04:29:43,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659911333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:43,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:43,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:29:43,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125263912] [2022-02-21 04:29:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:43,392 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:43,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:43,393 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,542 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-02-21 04:29:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:29:43,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:43,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:29:43,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2022-02-21 04:29:43,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2022-02-21 04:29:43,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2022-02-21 04:29:43,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:43,577 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-02-21 04:29:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-02-21 04:29:43,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:43,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states and 146 transitions. Second operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,590 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states and 146 transitions. Second operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,590 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,594 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-02-21 04:29:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:43,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:43,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 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 107 states and 146 transitions. [2022-02-21 04:29:43,600 INFO L87 Difference]: Start difference. First operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 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 107 states and 146 transitions. [2022-02-21 04:29:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:43,603 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-02-21 04:29:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:43,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:43,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:43,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2022-02-21 04:29:43,610 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-02-21 04:29:43,610 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-02-21 04:29:43,610 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:29:43,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2022-02-21 04:29:43,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:29:43,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:43,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:43,615 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] [2022-02-21 04:29:43,615 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] [2022-02-21 04:29:43,616 INFO L791 eck$LassoCheckResult]: Stem: 867#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; 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 840#L166 assume 0 == ~r1~0 % 256; 832#L167 assume ~id1~0 >= 0; 808#L168 assume 0 == ~st1~0; 809#L169 assume ~send1~0 == ~id1~0; 871#L170 assume 0 == ~mode1~0 % 256; 865#L171 assume ~id2~0 >= 0; 861#L172 assume 0 == ~st2~0; 862#L173 assume ~send2~0 == ~id2~0; 869#L174 assume 0 == ~mode2~0 % 256; 806#L175 assume ~id3~0 >= 0; 807#L176 assume 0 == ~st3~0; 866#L177 assume ~send3~0 == ~id3~0; 847#L178 assume 0 == ~mode3~0 % 256; 848#L179 assume ~id4~0 >= 0; 798#L180 assume 0 == ~st4~0; 799#L181 assume ~send4~0 == ~id4~0; 843#L182 assume 0 == ~mode4~0 % 256; 846#L183 assume ~id1~0 != ~id2~0; 823#L184 assume ~id1~0 != ~id3~0; 824#L185 assume ~id1~0 != ~id4~0; 850#L186 assume ~id2~0 != ~id3~0; 868#L187 assume ~id2~0 != ~id4~0; 825#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 818#L166-1 init_#res#1 := init_~tmp~0#1; 800#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 801#L24 assume !(0 == assume_abort_if_not_~cond#1); 821#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;main_~i2~0#1 := 0; 822#L325-2 [2022-02-21 04:29:43,617 INFO L793 eck$LassoCheckResult]: Loop: 822#L325-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; 900#L66 assume !(0 != ~mode1~0 % 256); 899#L80 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 898#L80-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; 844#L66-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; 897#L92 assume !(0 != ~mode2~0 % 256); 893#L105 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 892#L105-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; 890#L92-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; 889#L117 assume !(0 != ~mode3~0 % 256); 885#L130 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 884#L130-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 882#L117-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; 881#L142 assume !(0 != ~mode4~0 % 256); 880#L155 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 875#L155-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; 874#L142-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 873#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 872#L268 assume !(~r1~0 % 256 >= 4); 854#L271 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 855#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 904#L267-1 check_#res#1 := check_~tmp~1#1; 903#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 902#L351 assume !(0 == assert_~arg#1 % 256); 901#L346 assume { :end_inline_assert } true; 822#L325-2 [2022-02-21 04:29:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-02-21 04:29:43,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:43,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965549670] [2022-02-21 04:29:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,671 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -807545213, now seen corresponding path program 1 times [2022-02-21 04:29:43,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:43,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762682695] [2022-02-21 04:29:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,714 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1765655331, now seen corresponding path program 1 times [2022-02-21 04:29:43,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:43,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925705366] [2022-02-21 04:29:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:43,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:44,735 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:29:44,735 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:29:44,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:29:44,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:29:44,736 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:29:44,736 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:44,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:29:44,736 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:29:44,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:29:44,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:29:44,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:29:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:45,858 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12