./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:26:38,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:26:38,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:26:38,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:26:38,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:26:38,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:26:38,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:26:38,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:26:38,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:26:38,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:26:38,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:26:38,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:26:38,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:26:38,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:26:38,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:26:38,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:26:38,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:26:38,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:26:38,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:26:38,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:26:38,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:26:38,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:26:38,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:26:38,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:26:38,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:26:38,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:26:38,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:26:38,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:26:38,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:26:38,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:26:38,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:26:38,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:26:38,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:26:38,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:26:38,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:26:38,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:26:38,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:26:38,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:26:38,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:26:38,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:26:38,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:26:38,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:26:38,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:26:38,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:26:38,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:26:38,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:26:38,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:26:38,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:26:38,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:26:38,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:26:38,684 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:26:38,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:26:38,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:26:38,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:26:38,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:26:38,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:26:38,687 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:26:38,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:26:38,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:26:38,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:26:38,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:26:38,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:38,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:26:38,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:26:38,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:26:38,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:26:38,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:26:38,690 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:26:38,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:26:38,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:26:38,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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(G ! call(reach_error())) ) 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2022-02-20 18:26:38,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:26:38,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:26:38,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:26:38,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:26:38,948 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:26:38,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:39,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb97cab1/1f076ef21eac49c18941b2042b422e5d/FLAG79b6e0fa4 [2022-02-20 18:26:39,446 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:26:39,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:39,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb97cab1/1f076ef21eac49c18941b2042b422e5d/FLAG79b6e0fa4 [2022-02-20 18:26:39,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb97cab1/1f076ef21eac49c18941b2042b422e5d [2022-02-20 18:26:39,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:26:39,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:26:39,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:39,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:26:39,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:26:39,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db8b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39, skipping insertion in model container [2022-02-20 18:26:39,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:26:39,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:26:39,728 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2022-02-20 18:26:39,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:39,741 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:26:39,781 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2022-02-20 18:26:39,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:39,798 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:26:39,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39 WrapperNode [2022-02-20 18:26:39,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:39,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:39,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:26:39,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:26:39,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,844 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2022-02-20 18:26:39,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:39,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:26:39,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:26:39,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:26:39,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:26:39,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:26:39,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:26:39,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:26:39,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (1/1) ... [2022-02-20 18:26:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:26:39,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:26:39,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:26:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:26:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:26:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:26:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:26:40,092 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:26:40,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:26:40,589 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:26:40,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:26:40,596 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:26:40,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:40 BoogieIcfgContainer [2022-02-20 18:26:40,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:26:40,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:26:40,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:26:40,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:26:40,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:26:39" (1/3) ... [2022-02-20 18:26:40,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e5a91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:40, skipping insertion in model container [2022-02-20 18:26:40,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:39" (2/3) ... [2022-02-20 18:26:40,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e5a91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:40, skipping insertion in model container [2022-02-20 18:26:40,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:40" (3/3) ... [2022-02-20 18:26:40,605 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:40,626 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:26:40,626 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:26:40,670 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:26:40,675 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:26:40,676 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:26:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 78 states have internal predecessors, (129), 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-20 18:26:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:26:40,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:40,703 INFO L514 BasicCegarLoop]: trace 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-20 18:26:40,703 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 233700331, now seen corresponding path program 1 times [2022-02-20 18:26:40,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:40,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111254178] [2022-02-20 18:26:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:40,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {82#true} is VALID [2022-02-20 18:26:40,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {82#true} is VALID [2022-02-20 18:26:40,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {84#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:26:40,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {85#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:26:40,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {86#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:26:40,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {83#false} is VALID [2022-02-20 18:26:40,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#false} ~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;main_~i2~0#1 := 0; {83#false} is VALID [2022-02-20 18:26:40,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {83#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {83#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {83#false} assume !(node1_~m1~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:26:40,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {83#false} ~mode1~0 := 0; {83#false} is VALID [2022-02-20 18:26:40,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {83#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {83#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {83#false} assume !(node2_~m2~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:26:40,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {83#false} ~mode2~0 := 0; {83#false} is VALID [2022-02-20 18:26:40,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {83#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {83#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:26:40,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {83#false} assume !(node3_~m3~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:26:40,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {83#false} ~mode3~0 := 0; {83#false} is VALID [2022-02-20 18:26:40,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {83#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {83#false} is VALID [2022-02-20 18:26:40,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {83#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {83#false} is VALID [2022-02-20 18:26:40,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {83#false} check_#res#1 := check_~tmp~1#1; {83#false} is VALID [2022-02-20 18:26:40,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {83#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {83#false} is VALID [2022-02-20 18:26:40,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {83#false} assume 0 == assert_~arg#1 % 256; {83#false} is VALID [2022-02-20 18:26:40,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 18:26:40,914 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-20 18:26:40,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:40,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111254178] [2022-02-20 18:26:40,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111254178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:40,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:40,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:40,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642199378] [2022-02-20 18:26:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 18:26:40,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:40,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:40,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:40,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:40,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:40,982 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 78 states have internal predecessors, (129), 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 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:41,368 INFO L93 Difference]: Finished difference Result 191 states and 307 transitions. [2022-02-20 18:26:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:26:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 18:26:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 307 transitions. [2022-02-20 18:26:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 307 transitions. [2022-02-20 18:26:41,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 307 transitions. [2022-02-20 18:26:41,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:41,694 INFO L225 Difference]: With dead ends: 191 [2022-02-20 18:26:41,694 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:26:41,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:26:41,700 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 84 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:41,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 465 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:26:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2022-02-20 18:26:41,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:41,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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-20 18:26:41,741 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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-20 18:26:41,743 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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-20 18:26:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:41,756 INFO L93 Difference]: Finished difference Result 127 states and 187 transitions. [2022-02-20 18:26:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2022-02-20 18:26:41,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:41,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:41,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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 127 states. [2022-02-20 18:26:41,759 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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 127 states. [2022-02-20 18:26:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:41,771 INFO L93 Difference]: Finished difference Result 127 states and 187 transitions. [2022-02-20 18:26:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2022-02-20 18:26:41,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:41,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:41,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:41,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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-20 18:26:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2022-02-20 18:26:41,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 25 [2022-02-20 18:26:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:41,785 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2022-02-20 18:26:41,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2022-02-20 18:26:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:26:41,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:41,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:41,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:26:41,793 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 182027041, now seen corresponding path program 1 times [2022-02-20 18:26:41,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:41,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421971316] [2022-02-20 18:26:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:41,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {638#true} is VALID [2022-02-20 18:26:41,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {638#true} is VALID [2022-02-20 18:26:41,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {638#true} assume 0 == ~r1~0; {638#true} is VALID [2022-02-20 18:26:41,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {638#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {638#true} is VALID [2022-02-20 18:26:41,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {638#true} assume ~id1~0 >= 0; {638#true} is VALID [2022-02-20 18:26:41,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {638#true} assume 0 == ~st1~0; {638#true} is VALID [2022-02-20 18:26:41,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#true} assume ~send1~0 == ~id1~0; {638#true} is VALID [2022-02-20 18:26:41,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#true} assume 0 == ~mode1~0 % 256; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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;main_~i2~0#1 := 0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:26:41,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {640#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {639#false} is VALID [2022-02-20 18:26:41,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#false} assume !(node1_~m1~0#1 != ~nomsg~0); {639#false} is VALID [2022-02-20 18:26:41,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {639#false} ~mode1~0 := 0; {639#false} is VALID [2022-02-20 18:26:41,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {639#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {639#false} is VALID [2022-02-20 18:26:41,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {639#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {639#false} is VALID [2022-02-20 18:26:41,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {639#false} assume !(node2_~m2~0#1 != ~nomsg~0); {639#false} is VALID [2022-02-20 18:26:41,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {639#false} ~mode2~0 := 0; {639#false} is VALID [2022-02-20 18:26:41,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {639#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {639#false} is VALID [2022-02-20 18:26:41,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {639#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {639#false} is VALID [2022-02-20 18:26:41,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {639#false} assume !(node3_~m3~0#1 != ~nomsg~0); {639#false} is VALID [2022-02-20 18:26:41,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {639#false} ~mode3~0 := 0; {639#false} is VALID [2022-02-20 18:26:41,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {639#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {639#false} is VALID [2022-02-20 18:26:41,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {639#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {639#false} is VALID [2022-02-20 18:26:41,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {639#false} check_#res#1 := check_~tmp~1#1; {639#false} is VALID [2022-02-20 18:26:41,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {639#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {639#false} is VALID [2022-02-20 18:26:41,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {639#false} assume 0 == assert_~arg#1 % 256; {639#false} is VALID [2022-02-20 18:26:41,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {639#false} assume !false; {639#false} is VALID [2022-02-20 18:26:41,933 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-20 18:26:41,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:41,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421971316] [2022-02-20 18:26:41,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421971316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:41,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:41,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:41,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612265028] [2022-02-20 18:26:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2022-02-20 18:26:41,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:41,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-20 18:26:41,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:41,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:41,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:41,966 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-20 18:26:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,125 INFO L93 Difference]: Finished difference Result 167 states and 249 transitions. [2022-02-20 18:26:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2022-02-20 18:26:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-20 18:26:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-20 18:26:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:42,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2022-02-20 18:26:42,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:42,324 INFO L225 Difference]: With dead ends: 167 [2022-02-20 18:26:42,324 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 18:26:42,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:42,326 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:42,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 18:26:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-02-20 18:26:42,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:42,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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-20 18:26:42,335 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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-20 18:26:42,335 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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-20 18:26:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,339 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2022-02-20 18:26:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2022-02-20 18:26:42,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:42,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:42,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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 115 states. [2022-02-20 18:26:42,340 INFO L87 Difference]: Start difference. First operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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 115 states. [2022-02-20 18:26:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,346 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2022-02-20 18:26:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2022-02-20 18:26:42,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:42,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:42,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:42,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 112 states have internal predecessors, (165), 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-20 18:26:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2022-02-20 18:26:42,350 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 41 [2022-02-20 18:26:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:42,352 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2022-02-20 18:26:42,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-20 18:26:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2022-02-20 18:26:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:26:42,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:42,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:42,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:26:42,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:42,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 54990345, now seen corresponding path program 1 times [2022-02-20 18:26:42,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:42,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641838124] [2022-02-20 18:26:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:42,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:42,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {1180#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {1180#true} is VALID [2022-02-20 18:26:42,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1180#true} is VALID [2022-02-20 18:26:42,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1180#true} assume 0 == ~r1~0; {1180#true} is VALID [2022-02-20 18:26:42,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {1180#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1180#true} is VALID [2022-02-20 18:26:42,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {1180#true} assume ~id1~0 >= 0; {1180#true} is VALID [2022-02-20 18:26:42,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1180#true} assume 0 == ~st1~0; {1180#true} is VALID [2022-02-20 18:26:42,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {1180#true} assume ~send1~0 == ~id1~0; {1180#true} is VALID [2022-02-20 18:26:42,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1180#true} assume 0 == ~mode1~0 % 256; {1180#true} is VALID [2022-02-20 18:26:42,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#true} assume ~id2~0 >= 0; {1180#true} is VALID [2022-02-20 18:26:42,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#true} assume 0 == ~st2~0; {1180#true} is VALID [2022-02-20 18:26:42,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {1180#true} assume ~send2~0 == ~id2~0; {1180#true} is VALID [2022-02-20 18:26:42,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#true} assume 0 == ~mode2~0 % 256; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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;main_~i2~0#1 := 0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:42,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {1182#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:26:42,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {1181#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1181#false} is VALID [2022-02-20 18:26:42,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {1181#false} ~mode2~0 := 0; {1181#false} is VALID [2022-02-20 18:26:42,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {1181#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:26:42,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {1181#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:26:42,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {1181#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1181#false} is VALID [2022-02-20 18:26:42,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {1181#false} ~mode3~0 := 0; {1181#false} is VALID [2022-02-20 18:26:42,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {1181#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1181#false} is VALID [2022-02-20 18:26:42,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {1181#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1181#false} is VALID [2022-02-20 18:26:42,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {1181#false} check_#res#1 := check_~tmp~1#1; {1181#false} is VALID [2022-02-20 18:26:42,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {1181#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {1181#false} is VALID [2022-02-20 18:26:42,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {1181#false} assume 0 == assert_~arg#1 % 256; {1181#false} is VALID [2022-02-20 18:26:42,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {1181#false} assume !false; {1181#false} is VALID [2022-02-20 18:26:42,492 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-20 18:26:42,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:42,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641838124] [2022-02-20 18:26:42,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641838124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:42,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:42,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:42,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914574307] [2022-02-20 18:26:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) Word has length 42 [2022-02-20 18:26:42,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:42,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-20 18:26:42,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:42,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:42,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:42,527 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-20 18:26:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,688 INFO L93 Difference]: Finished difference Result 269 states and 409 transitions. [2022-02-20 18:26:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:42,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) Word has length 42 [2022-02-20 18:26:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-20 18:26:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-20 18:26:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:42,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2022-02-20 18:26:42,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:42,883 INFO L225 Difference]: With dead ends: 269 [2022-02-20 18:26:42,883 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 18:26:42,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:42,885 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:42,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 18:26:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-02-20 18:26:42,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:42,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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-20 18:26:42,899 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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-20 18:26:42,899 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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-20 18:26:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,904 INFO L93 Difference]: Finished difference Result 179 states and 265 transitions. [2022-02-20 18:26:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 265 transitions. [2022-02-20 18:26:42,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:42,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:42,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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 179 states. [2022-02-20 18:26:42,906 INFO L87 Difference]: Start difference. First operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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 179 states. [2022-02-20 18:26:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:42,911 INFO L93 Difference]: Finished difference Result 179 states and 265 transitions. [2022-02-20 18:26:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 265 transitions. [2022-02-20 18:26:42,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:42,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:42,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:42,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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-20 18:26:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2022-02-20 18:26:42,917 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 42 [2022-02-20 18:26:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:42,918 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2022-02-20 18:26:42,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-20 18:26:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2022-02-20 18:26:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:26:42,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:42,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:42,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:26:42,919 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1508061361, now seen corresponding path program 1 times [2022-02-20 18:26:42,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:42,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169040248] [2022-02-20 18:26:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:42,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {2041#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {2041#true} is VALID [2022-02-20 18:26:42,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2041#true} is VALID [2022-02-20 18:26:42,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {2041#true} assume 0 == ~r1~0; {2041#true} is VALID [2022-02-20 18:26:42,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {2041#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2041#true} is VALID [2022-02-20 18:26:42,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {2041#true} assume ~id1~0 >= 0; {2041#true} is VALID [2022-02-20 18:26:42,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume 0 == ~st1~0; {2041#true} is VALID [2022-02-20 18:26:42,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {2041#true} assume ~send1~0 == ~id1~0; {2041#true} is VALID [2022-02-20 18:26:42,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {2041#true} assume 0 == ~mode1~0 % 256; {2041#true} is VALID [2022-02-20 18:26:42,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {2041#true} assume ~id2~0 >= 0; {2041#true} is VALID [2022-02-20 18:26:42,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {2041#true} assume 0 == ~st2~0; {2041#true} is VALID [2022-02-20 18:26:42,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {2041#true} assume ~send2~0 == ~id2~0; {2041#true} is VALID [2022-02-20 18:26:42,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {2041#true} assume 0 == ~mode2~0 % 256; {2041#true} is VALID [2022-02-20 18:26:42,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {2041#true} assume ~id3~0 >= 0; {2041#true} is VALID [2022-02-20 18:26:42,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {2041#true} assume 0 == ~st3~0; {2041#true} is VALID [2022-02-20 18:26:42,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {2041#true} assume ~send3~0 == ~id3~0; {2041#true} is VALID [2022-02-20 18:26:42,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {2041#true} assume 0 == ~mode3~0 % 256; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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;main_~i2~0#1 := 0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:42,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2042#false} is VALID [2022-02-20 18:26:42,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {2042#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2042#false} is VALID [2022-02-20 18:26:42,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {2042#false} ~mode3~0 := 0; {2042#false} is VALID [2022-02-20 18:26:43,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {2042#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2042#false} is VALID [2022-02-20 18:26:43,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {2042#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2042#false} is VALID [2022-02-20 18:26:43,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {2042#false} check_#res#1 := check_~tmp~1#1; {2042#false} is VALID [2022-02-20 18:26:43,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {2042#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {2042#false} is VALID [2022-02-20 18:26:43,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {2042#false} assume 0 == assert_~arg#1 % 256; {2042#false} is VALID [2022-02-20 18:26:43,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {2042#false} assume !false; {2042#false} is VALID [2022-02-20 18:26:43,001 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-20 18:26:43,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:43,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169040248] [2022-02-20 18:26:43,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169040248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:43,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:43,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:43,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41835500] [2022-02-20 18:26:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-02-20 18:26:43,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:43,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 18:26:43,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:43,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:43,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:43,042 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 18:26:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:43,212 INFO L93 Difference]: Finished difference Result 437 states and 666 transitions. [2022-02-20 18:26:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-02-20 18:26:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 18:26:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 18:26:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-02-20 18:26:43,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2022-02-20 18:26:43,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:43,398 INFO L225 Difference]: With dead ends: 437 [2022-02-20 18:26:43,398 INFO L226 Difference]: Without dead ends: 283 [2022-02-20 18:26:43,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:43,400 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:43,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-20 18:26:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2022-02-20 18:26:43,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:43,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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-20 18:26:43,417 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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-20 18:26:43,417 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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-20 18:26:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:43,425 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-02-20 18:26:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2022-02-20 18:26:43,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:43,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:43,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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 283 states. [2022-02-20 18:26:43,428 INFO L87 Difference]: Start difference. First operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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 283 states. [2022-02-20 18:26:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:43,436 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-02-20 18:26:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2022-02-20 18:26:43,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:43,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:43,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:43,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5) internal successors, (420), 280 states have internal predecessors, (420), 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-20 18:26:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 420 transitions. [2022-02-20 18:26:43,447 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 420 transitions. Word has length 43 [2022-02-20 18:26:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:43,447 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 420 transitions. [2022-02-20 18:26:43,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 18:26:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 420 transitions. [2022-02-20 18:26:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:26:43,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:43,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:43,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:26:43,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -922713191, now seen corresponding path program 1 times [2022-02-20 18:26:43,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:43,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846093786] [2022-02-20 18:26:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:43,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {3432#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {3432#true} is VALID [2022-02-20 18:26:43,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3432#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3432#true} is VALID [2022-02-20 18:26:43,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {3432#true} assume 0 == ~r1~0; {3432#true} is VALID [2022-02-20 18:26:43,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {3432#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3432#true} is VALID [2022-02-20 18:26:43,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {3432#true} assume ~id1~0 >= 0; {3432#true} is VALID [2022-02-20 18:26:43,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {3432#true} assume 0 == ~st1~0; {3434#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:43,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {3434#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3434#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:43,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3434#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:43,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3434#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:43,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#(<= ~st1~0 0)} assume 0 == ~st2~0; {3435#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {3435#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3435#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {3435#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3435#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {3435#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3435#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {3435#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;main_~i2~0#1 := 0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:43,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {3436#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3433#false} is VALID [2022-02-20 18:26:43,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {3433#false} check_#res#1 := check_~tmp~1#1; {3433#false} is VALID [2022-02-20 18:26:43,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {3433#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {3433#false} is VALID [2022-02-20 18:26:43,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {3433#false} assume 0 == assert_~arg#1 % 256; {3433#false} is VALID [2022-02-20 18:26:43,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {3433#false} assume !false; {3433#false} is VALID [2022-02-20 18:26:43,590 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-20 18:26:43,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:43,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846093786] [2022-02-20 18:26:43,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846093786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:43,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:43,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:43,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554824598] [2022-02-20 18:26:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 44 [2022-02-20 18:26:43,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:43,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-20 18:26:43,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:43,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:43,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:43,624 INFO L87 Difference]: Start difference. First operand 281 states and 420 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-20 18:26:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:44,288 INFO L93 Difference]: Finished difference Result 1313 states and 2008 transitions. [2022-02-20 18:26:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:26:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 44 [2022-02-20 18:26:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-20 18:26:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-02-20 18:26:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-20 18:26:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-02-20 18:26:44,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-02-20 18:26:44,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:44,684 INFO L225 Difference]: With dead ends: 1313 [2022-02-20 18:26:44,684 INFO L226 Difference]: Without dead ends: 1055 [2022-02-20 18:26:44,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:26:44,686 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 412 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:44,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 551 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-02-20 18:26:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 537. [2022-02-20 18:26:44,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:44,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1055 states. Second operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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-20 18:26:44,811 INFO L74 IsIncluded]: Start isIncluded. First operand 1055 states. Second operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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-20 18:26:44,812 INFO L87 Difference]: Start difference. First operand 1055 states. Second operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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-20 18:26:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:44,863 INFO L93 Difference]: Finished difference Result 1055 states and 1595 transitions. [2022-02-20 18:26:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1595 transitions. [2022-02-20 18:26:44,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:44,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:44,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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 1055 states. [2022-02-20 18:26:44,868 INFO L87 Difference]: Start difference. First operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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 1055 states. [2022-02-20 18:26:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:44,917 INFO L93 Difference]: Finished difference Result 1055 states and 1595 transitions. [2022-02-20 18:26:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1595 transitions. [2022-02-20 18:26:44,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:44,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:44,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:44,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.492537313432836) internal successors, (800), 536 states have internal predecessors, (800), 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-20 18:26:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 800 transitions. [2022-02-20 18:26:44,937 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 800 transitions. Word has length 44 [2022-02-20 18:26:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:44,937 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 800 transitions. [2022-02-20 18:26:44,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-20 18:26:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 800 transitions. [2022-02-20 18:26:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:26:44,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:44,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:44,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:26:44,939 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1077338731, now seen corresponding path program 1 times [2022-02-20 18:26:44,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:44,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741737432] [2022-02-20 18:26:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:45,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {7686#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {7686#true} is VALID [2022-02-20 18:26:45,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {7686#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7686#true} is VALID [2022-02-20 18:26:45,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {7686#true} assume 0 == ~r1~0; {7686#true} is VALID [2022-02-20 18:26:45,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {7686#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == main_~i2~0#1); {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} ~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;main_~i2~0#1 := 0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:45,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {7688#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:45,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:45,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:45,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:45,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:45,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {7689#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:45,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:45,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:45,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:45,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~mode3~0 % 256); {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:45,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {7690#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~alive3~0 % 256); {7687#false} is VALID [2022-02-20 18:26:45,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {7687#false} assume !(~send3~0 != ~id3~0); {7687#false} is VALID [2022-02-20 18:26:45,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {7687#false} ~mode3~0 := 1; {7687#false} is VALID [2022-02-20 18:26:45,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7687#false} is VALID [2022-02-20 18:26:45,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {7687#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7687#false} is VALID [2022-02-20 18:26:45,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {7687#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {7687#false} is VALID [2022-02-20 18:26:45,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {7687#false} check_#res#1 := check_~tmp~1#1; {7687#false} is VALID [2022-02-20 18:26:45,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {7687#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {7687#false} is VALID [2022-02-20 18:26:45,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {7687#false} assume 0 == assert_~arg#1 % 256; {7687#false} is VALID [2022-02-20 18:26:45,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {7687#false} assume !false; {7687#false} is VALID [2022-02-20 18:26:45,046 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-20 18:26:45,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:45,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741737432] [2022-02-20 18:26:45,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741737432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:45,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:45,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:45,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995540591] [2022-02-20 18:26:45,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 45 [2022-02-20 18:26:45,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:45,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 18:26:45,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:45,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:45,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:45,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:45,083 INFO L87 Difference]: Start difference. First operand 537 states and 800 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 18:26:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:46,085 INFO L93 Difference]: Finished difference Result 1911 states and 2843 transitions. [2022-02-20 18:26:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:26:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 45 [2022-02-20 18:26:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 18:26:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2022-02-20 18:26:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 18:26:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2022-02-20 18:26:46,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 315 transitions. [2022-02-20 18:26:46,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:46,446 INFO L225 Difference]: With dead ends: 1911 [2022-02-20 18:26:46,446 INFO L226 Difference]: Without dead ends: 1397 [2022-02-20 18:26:46,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:46,448 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 209 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:46,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 294 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-02-20 18:26:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1393. [2022-02-20 18:26:46,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:46,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1397 states. Second operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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-20 18:26:46,923 INFO L74 IsIncluded]: Start isIncluded. First operand 1397 states. Second operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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-20 18:26:46,925 INFO L87 Difference]: Start difference. First operand 1397 states. Second operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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-20 18:26:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:47,004 INFO L93 Difference]: Finished difference Result 1397 states and 2050 transitions. [2022-02-20 18:26:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2050 transitions. [2022-02-20 18:26:47,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:47,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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 1397 states. [2022-02-20 18:26:47,012 INFO L87 Difference]: Start difference. First operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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 1397 states. [2022-02-20 18:26:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:47,094 INFO L93 Difference]: Finished difference Result 1397 states and 2050 transitions. [2022-02-20 18:26:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2050 transitions. [2022-02-20 18:26:47,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:47,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:47,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:47,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.471264367816092) internal successors, (2048), 1392 states have internal predecessors, (2048), 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-20 18:26:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2048 transitions. [2022-02-20 18:26:47,199 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2048 transitions. Word has length 45 [2022-02-20 18:26:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:47,199 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 2048 transitions. [2022-02-20 18:26:47,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 18:26:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2048 transitions. [2022-02-20 18:26:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:26:47,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:47,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:47,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:26:47,201 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1270898830, now seen corresponding path program 1 times [2022-02-20 18:26:47,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:47,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422983446] [2022-02-20 18:26:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:47,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {14353#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {14353#true} is VALID [2022-02-20 18:26:47,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {14353#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14353#true} is VALID [2022-02-20 18:26:47,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {14353#true} assume 0 == ~r1~0; {14353#true} is VALID [2022-02-20 18:26:47,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {14353#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {14353#true} is VALID [2022-02-20 18:26:47,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {14353#true} assume ~id1~0 >= 0; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {14353#true} assume 0 == ~st1~0; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {14353#true} assume ~send1~0 == ~id1~0; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {14353#true} assume 0 == ~mode1~0 % 256; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {14353#true} assume ~id2~0 >= 0; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {14353#true} assume 0 == ~st2~0; {14353#true} is VALID [2022-02-20 18:26:47,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {14353#true} assume ~send2~0 == ~id2~0; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {14353#true} assume 0 == ~mode2~0 % 256; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {14353#true} assume ~id3~0 >= 0; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {14353#true} assume 0 == ~st3~0; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {14353#true} assume ~send3~0 == ~id3~0; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {14353#true} assume 0 == ~mode3~0 % 256; {14353#true} is VALID [2022-02-20 18:26:47,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {14353#true} assume ~id1~0 != ~id2~0; {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {14353#true} assume ~id1~0 != ~id3~0; {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {14353#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {14353#true} init_#res#1 := init_~tmp~0#1; {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {14353#true} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {14353#true} assume !(0 == main_~i2~0#1); {14353#true} is VALID [2022-02-20 18:26:47,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {14353#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;main_~i2~0#1 := 0; {14353#true} is VALID [2022-02-20 18:26:47,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {14353#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14353#true} is VALID [2022-02-20 18:26:47,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {14353#true} assume !(0 != ~mode1~0 % 256); {14353#true} is VALID [2022-02-20 18:26:47,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#true} assume !(0 != ~alive1~0 % 256); {14353#true} is VALID [2022-02-20 18:26:47,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {14353#true} assume !(~send1~0 != ~id1~0); {14353#true} is VALID [2022-02-20 18:26:47,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {14353#true} ~mode1~0 := 1; {14353#true} is VALID [2022-02-20 18:26:47,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {14353#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14353#true} is VALID [2022-02-20 18:26:47,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {14353#true} assume !(0 != ~mode2~0 % 256); {14353#true} is VALID [2022-02-20 18:26:47,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {14353#true} assume 0 != ~alive2~0 % 256; {14353#true} is VALID [2022-02-20 18:26:47,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {14353#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14353#true} is VALID [2022-02-20 18:26:47,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {14353#true} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {14353#true} is VALID [2022-02-20 18:26:47,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {14353#true} ~mode2~0 := 1; {14353#true} is VALID [2022-02-20 18:26:47,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {14353#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14353#true} is VALID [2022-02-20 18:26:47,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {14353#true} assume !(0 != ~mode3~0 % 256); {14353#true} is VALID [2022-02-20 18:26:47,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {14353#true} assume !(0 != ~alive3~0 % 256); {14353#true} is VALID [2022-02-20 18:26:47,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {14353#true} assume !(~send3~0 != ~id3~0); {14353#true} is VALID [2022-02-20 18:26:47,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {14353#true} ~mode3~0 := 1; {14353#true} is VALID [2022-02-20 18:26:47,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {14353#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14353#true} is VALID [2022-02-20 18:26:47,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {14353#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14353#true} is VALID [2022-02-20 18:26:47,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {14353#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {14355#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:26:47,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {14355#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {14356#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:26:47,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {14356#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {14357#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:26:47,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {14357#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {14354#false} is VALID [2022-02-20 18:26:47,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {14354#false} assume !false; {14354#false} is VALID [2022-02-20 18:26:47,336 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-20 18:26:47,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:47,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422983446] [2022-02-20 18:26:47,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422983446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:47,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:47,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:47,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298874084] [2022-02-20 18:26:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:47,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) Word has length 46 [2022-02-20 18:26:47,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:47,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-20 18:26:47,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:47,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:47,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:47,374 INFO L87 Difference]: Start difference. First operand 1393 states and 2048 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-20 18:26:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:49,470 INFO L93 Difference]: Finished difference Result 2955 states and 4265 transitions. [2022-02-20 18:26:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:26:49,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) Word has length 46 [2022-02-20 18:26:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-20 18:26:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 18:26:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-20 18:26:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 18:26:49,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 191 transitions. [2022-02-20 18:26:49,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:49,956 INFO L225 Difference]: With dead ends: 2955 [2022-02-20 18:26:49,956 INFO L226 Difference]: Without dead ends: 2953 [2022-02-20 18:26:49,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:26:49,957 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 225 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:49,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 455 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2022-02-20 18:26:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1537. [2022-02-20 18:26:50,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:50,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2953 states. Second operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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-20 18:26:50,781 INFO L74 IsIncluded]: Start isIncluded. First operand 2953 states. Second operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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-20 18:26:50,784 INFO L87 Difference]: Start difference. First operand 2953 states. Second operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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-20 18:26:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:51,051 INFO L93 Difference]: Finished difference Result 2953 states and 4216 transitions. [2022-02-20 18:26:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4216 transitions. [2022-02-20 18:26:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:51,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:51,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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 2953 states. [2022-02-20 18:26:51,062 INFO L87 Difference]: Start difference. First operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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 2953 states. [2022-02-20 18:26:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:51,354 INFO L93 Difference]: Finished difference Result 2953 states and 4216 transitions. [2022-02-20 18:26:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4216 transitions. [2022-02-20 18:26:51,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:51,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:51,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:51,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.4270833333333333) internal successors, (2192), 1536 states have internal predecessors, (2192), 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-20 18:26:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2192 transitions. [2022-02-20 18:26:51,472 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2192 transitions. Word has length 46 [2022-02-20 18:26:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:51,473 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 2192 transitions. [2022-02-20 18:26:51,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-20 18:26:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2192 transitions. [2022-02-20 18:26:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:26:51,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:51,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:51,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:26:51,474 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 795736558, now seen corresponding path program 1 times [2022-02-20 18:26:51,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:51,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981748259] [2022-02-20 18:26:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:51,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {25631#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {25631#true} is VALID [2022-02-20 18:26:51,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {25631#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25631#true} is VALID [2022-02-20 18:26:51,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {25631#true} assume 0 == ~r1~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {25633#(<= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {25633#(<= ~r1~0 0)} assume ~id1~0 >= 0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~st1~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {25633#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {25633#(<= ~r1~0 0)} assume ~id2~0 >= 0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~st2~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {25633#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {25633#(<= ~r1~0 0)} assume ~id3~0 >= 0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~st3~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {25633#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {25633#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {25633#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {25633#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {25633#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {25633#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {25633#(<= ~r1~0 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {25633#(<= ~r1~0 0)} ~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;main_~i2~0#1 := 0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {25633#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {25633#(<= ~r1~0 0)} assume !(~send1~0 != ~id1~0); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {25633#(<= ~r1~0 0)} ~mode1~0 := 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {25633#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {25633#(<= ~r1~0 0)} assume 0 != ~alive2~0 % 256; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {25633#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {25633#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {25633#(<= ~r1~0 0)} ~mode2~0 := 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {25633#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {25633#(<= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {25633#(<= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {25633#(<= ~r1~0 0)} ~mode3~0 := 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {25633#(<= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {25633#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25633#(<= ~r1~0 0)} is VALID [2022-02-20 18:26:51,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {25633#(<= ~r1~0 0)} assume !(~r1~0 < 3); {25632#false} is VALID [2022-02-20 18:26:51,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {25632#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {25632#false} is VALID [2022-02-20 18:26:51,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {25632#false} check_#res#1 := check_~tmp~1#1; {25632#false} is VALID [2022-02-20 18:26:51,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {25632#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {25632#false} is VALID [2022-02-20 18:26:51,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {25632#false} assume 0 == assert_~arg#1 % 256; {25632#false} is VALID [2022-02-20 18:26:51,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {25632#false} assume !false; {25632#false} is VALID [2022-02-20 18:26:51,530 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-20 18:26:51,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:51,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981748259] [2022-02-20 18:26:51,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981748259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:51,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:51,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:51,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745245766] [2022-02-20 18:26:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2022-02-20 18:26:51,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:51,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:26:51,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:51,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:51,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:51,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:51,562 INFO L87 Difference]: Start difference. First operand 1537 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:26:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:53,363 INFO L93 Difference]: Finished difference Result 3651 states and 5220 transitions. [2022-02-20 18:26:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:53,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2022-02-20 18:26:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:26:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2022-02-20 18:26:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:26:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2022-02-20 18:26:53,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 258 transitions. [2022-02-20 18:26:53,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:53,706 INFO L225 Difference]: With dead ends: 3651 [2022-02-20 18:26:53,706 INFO L226 Difference]: Without dead ends: 2137 [2022-02-20 18:26:53,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:53,707 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:53,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-02-20 18:26:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2135. [2022-02-20 18:26:54,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:54,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2137 states. Second operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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-20 18:26:54,829 INFO L74 IsIncluded]: Start isIncluded. First operand 2137 states. Second operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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-20 18:26:54,832 INFO L87 Difference]: Start difference. First operand 2137 states. Second operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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-20 18:26:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:54,980 INFO L93 Difference]: Finished difference Result 2137 states and 3031 transitions. [2022-02-20 18:26:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3031 transitions. [2022-02-20 18:26:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:54,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:54,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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 2137 states. [2022-02-20 18:26:54,995 INFO L87 Difference]: Start difference. First operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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 2137 states. [2022-02-20 18:26:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:55,133 INFO L93 Difference]: Finished difference Result 2137 states and 3031 transitions. [2022-02-20 18:26:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3031 transitions. [2022-02-20 18:26:55,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:55,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:55,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:55,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2135 states, 2134 states have (on average 1.4198687910028116) internal successors, (3030), 2134 states have internal predecessors, (3030), 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-20 18:26:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 3030 transitions. [2022-02-20 18:26:55,277 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 3030 transitions. Word has length 47 [2022-02-20 18:26:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:55,278 INFO L470 AbstractCegarLoop]: Abstraction has 2135 states and 3030 transitions. [2022-02-20 18:26:55,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:26:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 3030 transitions. [2022-02-20 18:26:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:26:55,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:55,279 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:26:55,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:26:55,279 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1282796535, now seen corresponding path program 1 times [2022-02-20 18:26:55,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:55,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604504130] [2022-02-20 18:26:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:55,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {36780#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {36780#true} is VALID [2022-02-20 18:26:55,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {36780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36780#true} is VALID [2022-02-20 18:26:55,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {36780#true} assume 0 == ~r1~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} init_#res#1 := init_~tmp~0#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~i2~0#1); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~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;main_~i2~0#1 := 0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode1~0 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive1~0 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send1~0 != ~id1~0); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode1~0 := 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode2~0 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~alive2~0 % 256; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode2~0 := 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive3~0 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send3~0 != ~id3~0); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode3~0 := 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:26:55,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {36782#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {36783#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {36783#(<= ~r1~0 1)} ~mode1~0 := 0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {36783#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {36783#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {36783#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {36783#(<= ~r1~0 1)} ~mode2~0 := 0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {36783#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {36783#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {36783#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {36783#(<= ~r1~0 1)} ~mode3~0 := 0; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {36783#(<= ~r1~0 1)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {36783#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36783#(<= ~r1~0 1)} is VALID [2022-02-20 18:26:55,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {36783#(<= ~r1~0 1)} assume !(~r1~0 < 3); {36781#false} is VALID [2022-02-20 18:26:55,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {36781#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36781#false} is VALID [2022-02-20 18:26:55,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {36781#false} check_#res#1 := check_~tmp~1#1; {36781#false} is VALID [2022-02-20 18:26:55,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {36781#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {36781#false} is VALID [2022-02-20 18:26:55,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {36781#false} assume 0 == assert_~arg#1 % 256; {36781#false} is VALID [2022-02-20 18:26:55,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {36781#false} assume !false; {36781#false} is VALID [2022-02-20 18:26:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:26:55,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:55,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604504130] [2022-02-20 18:26:55,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604504130] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:26:55,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10229637] [2022-02-20 18:26:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:26:55,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:26:55,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:26:55,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:26:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:55,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 18:26:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:55,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:26:55,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {36780#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {36780#true} is VALID [2022-02-20 18:26:55,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {36780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36780#true} is VALID [2022-02-20 18:26:55,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {36780#true} assume 0 == ~r1~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {36793#(= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {36793#(= ~r1~0 0)} assume ~id1~0 >= 0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~st1~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {36793#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {36793#(= ~r1~0 0)} assume ~id2~0 >= 0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~st2~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {36793#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {36793#(= ~r1~0 0)} assume ~id3~0 >= 0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~st3~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {36793#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {36793#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {36793#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {36793#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {36793#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {36793#(= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {36793#(= ~r1~0 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {36793#(= ~r1~0 0)} assume !(0 == main_~i2~0#1); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {36793#(= ~r1~0 0)} ~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;main_~i2~0#1 := 0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {36793#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {36793#(= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {36793#(= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {36793#(= ~r1~0 0)} assume !(~send1~0 != ~id1~0); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {36793#(= ~r1~0 0)} ~mode1~0 := 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {36793#(= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {36793#(= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {36793#(= ~r1~0 0)} assume 0 != ~alive2~0 % 256; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {36793#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {36793#(= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {36793#(= ~r1~0 0)} ~mode2~0 := 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {36793#(= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {36793#(= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {36793#(= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {36793#(= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {36793#(= ~r1~0 0)} ~mode3~0 := 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {36793#(= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {36793#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {36793#(= ~r1~0 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {36911#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {36911#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} check_#res#1 := check_~tmp~1#1; {36915#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {36915#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {36793#(= ~r1~0 0)} assume !(0 == assert_~arg#1 % 256); {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {36793#(= ~r1~0 0)} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {36793#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36793#(= ~r1~0 0)} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {36793#(= ~r1~0 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {36931#(= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {36931#(= ~r1~0 1)} ~mode1~0 := 0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {36931#(= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {36931#(= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {36931#(= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {36931#(= ~r1~0 1)} ~mode2~0 := 0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {36931#(= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {36931#(= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {36931#(= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {36931#(= ~r1~0 1)} ~mode3~0 := 0; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {36931#(= ~r1~0 1)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {36931#(= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36931#(= ~r1~0 1)} is VALID [2022-02-20 18:26:55,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {36931#(= ~r1~0 1)} assume !(~r1~0 < 3); {36781#false} is VALID [2022-02-20 18:26:55,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {36781#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36781#false} is VALID [2022-02-20 18:26:55,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {36781#false} check_#res#1 := check_~tmp~1#1; {36781#false} is VALID [2022-02-20 18:26:55,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {36781#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {36781#false} is VALID [2022-02-20 18:26:55,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {36781#false} assume 0 == assert_~arg#1 % 256; {36781#false} is VALID [2022-02-20 18:26:55,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {36781#false} assume !false; {36781#false} is VALID [2022-02-20 18:26:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:26:55,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:26:56,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {36781#false} assume !false; {36781#false} is VALID [2022-02-20 18:26:56,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {36781#false} assume 0 == assert_~arg#1 % 256; {36781#false} is VALID [2022-02-20 18:26:56,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {36781#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {36781#false} is VALID [2022-02-20 18:26:56,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {36781#false} check_#res#1 := check_~tmp~1#1; {36781#false} is VALID [2022-02-20 18:26:56,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {36781#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36781#false} is VALID [2022-02-20 18:26:56,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {37001#(< ~r1~0 3)} assume !(~r1~0 < 3); {36781#false} is VALID [2022-02-20 18:26:56,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {37001#(< ~r1~0 3)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {37001#(< ~r1~0 3)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {37001#(< ~r1~0 3)} ~mode3~0 := 0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,669 INFO L290 TraceCheckUtils]: 56: Hoare triple {37001#(< ~r1~0 3)} assume !(node3_~m3~0#1 != ~nomsg~0); {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,669 INFO L290 TraceCheckUtils]: 55: Hoare triple {37001#(< ~r1~0 3)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {37001#(< ~r1~0 3)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {37001#(< ~r1~0 3)} ~mode2~0 := 0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {37001#(< ~r1~0 3)} assume !(node2_~m2~0#1 != ~nomsg~0); {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {37001#(< ~r1~0 3)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {37001#(< ~r1~0 3)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {37001#(< ~r1~0 3)} ~mode1~0 := 0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {37001#(< ~r1~0 3)} assume !(node1_~m1~0#1 != ~nomsg~0); {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37001#(< ~r1~0 3)} is VALID [2022-02-20 18:26:56,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == assert_~arg#1 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} check_#res#1 := check_~tmp~1#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode3~0 := 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~send3~0 != ~id3~0); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~alive3~0 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode3~0 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode2~0 := 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 != ~alive2~0 % 256; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode2~0 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode1~0 := 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~send1~0 != ~id1~0); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~alive1~0 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode1~0 % 256); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~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;main_~i2~0#1 := 0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == main_~i2~0#1); {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} init_#res#1 := init_~tmp~0#1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id3~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id2~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode3~0 % 256; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 == ~id3~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st3~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id3~0 >= 0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode2~0 % 256; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 == ~id2~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st2~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 >= 0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode1~0 % 256; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 == ~id1~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 >= 0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {36780#true} assume 0 == ~r1~0; {37041#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:26:56,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {36780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36780#true} is VALID [2022-02-20 18:26:56,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {36780#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {36780#true} is VALID [2022-02-20 18:26:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:26:56,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10229637] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:26:56,695 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:26:56,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2022-02-20 18:26:56,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867522530] [2022-02-20 18:26:56,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:26:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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) Word has length 66 [2022-02-20 18:26:56,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:56,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-20 18:26:56,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:56,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:26:56,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:26:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:26:56,847 INFO L87 Difference]: Start difference. First operand 2135 states and 3030 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-20 18:27:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:01,627 INFO L93 Difference]: Finished difference Result 6595 states and 9454 transitions. [2022-02-20 18:27:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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) Word has length 66 [2022-02-20 18:27:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-20 18:27:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 482 transitions. [2022-02-20 18:27:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-20 18:27:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 482 transitions. [2022-02-20 18:27:01,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 482 transitions. [2022-02-20 18:27:01,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:02,754 INFO L225 Difference]: With dead ends: 6595 [2022-02-20 18:27:02,754 INFO L226 Difference]: Without dead ends: 5081 [2022-02-20 18:27:02,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:27:02,757 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 593 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:02,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 902 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2022-02-20 18:27:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 4831. [2022-02-20 18:27:05,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:05,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5081 states. Second operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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-20 18:27:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand 5081 states. Second operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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-20 18:27:05,266 INFO L87 Difference]: Start difference. First operand 5081 states. Second operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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-20 18:27:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:05,978 INFO L93 Difference]: Finished difference Result 5081 states and 7189 transitions. [2022-02-20 18:27:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 7189 transitions. [2022-02-20 18:27:05,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:05,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:05,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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 5081 states. [2022-02-20 18:27:05,993 INFO L87 Difference]: Start difference. First operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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 5081 states. [2022-02-20 18:27:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:06,749 INFO L93 Difference]: Finished difference Result 5081 states and 7189 transitions. [2022-02-20 18:27:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 7189 transitions. [2022-02-20 18:27:06,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:06,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:06,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:06,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4831 states, 4830 states have (on average 1.4140786749482401) internal successors, (6830), 4830 states have internal predecessors, (6830), 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-20 18:27:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 6830 transitions. [2022-02-20 18:27:07,527 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 6830 transitions. Word has length 66 [2022-02-20 18:27:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:07,527 INFO L470 AbstractCegarLoop]: Abstraction has 4831 states and 6830 transitions. [2022-02-20 18:27:07,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-20 18:27:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 6830 transitions. [2022-02-20 18:27:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:27:07,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:07,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:27:07,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 18:27:07,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:27:07,729 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1183086589, now seen corresponding path program 1 times [2022-02-20 18:27:07,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:07,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075620923] [2022-02-20 18:27:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:07,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {60904#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {60904#true} is VALID [2022-02-20 18:27:07,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {60904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60904#true} is VALID [2022-02-20 18:27:07,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {60904#true} assume 0 == ~r1~0; {60904#true} is VALID [2022-02-20 18:27:07,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {60904#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {60904#true} is VALID [2022-02-20 18:27:07,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {60904#true} assume ~id1~0 >= 0; {60904#true} is VALID [2022-02-20 18:27:07,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {60904#true} assume 0 == ~st1~0; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {60904#true} assume ~send1~0 == ~id1~0; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {60904#true} assume 0 == ~mode1~0 % 256; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {60904#true} assume ~id2~0 >= 0; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {60904#true} assume 0 == ~st2~0; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {60904#true} assume ~send2~0 == ~id2~0; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {60904#true} assume 0 == ~mode2~0 % 256; {60904#true} is VALID [2022-02-20 18:27:07,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {60904#true} assume ~id3~0 >= 0; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {60904#true} assume 0 == ~st3~0; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {60904#true} assume ~send3~0 == ~id3~0; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {60904#true} assume 0 == ~mode3~0 % 256; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {60904#true} assume ~id1~0 != ~id2~0; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {60904#true} assume ~id1~0 != ~id3~0; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {60904#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {60904#true} is VALID [2022-02-20 18:27:07,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {60904#true} init_#res#1 := init_~tmp~0#1; {60904#true} is VALID [2022-02-20 18:27:07,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {60904#true} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {60904#true} is VALID [2022-02-20 18:27:07,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {60904#true} assume !(0 == main_~i2~0#1); {60904#true} is VALID [2022-02-20 18:27:07,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {60904#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;main_~i2~0#1 := 0; {60904#true} is VALID [2022-02-20 18:27:07,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {60904#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60904#true} is VALID [2022-02-20 18:27:07,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {60904#true} assume !(0 != ~mode1~0 % 256); {60904#true} is VALID [2022-02-20 18:27:07,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {60904#true} assume !(0 != ~alive1~0 % 256); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume 0 != ~alive2~0 % 256; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 != ~alive3~0 % 256); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode3~0 := 1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} check_#res#1 := check_~tmp~1#1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == assert_~arg#1 % 256); {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume node1_~m1~0#1 != ~nomsg~0; {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {60906#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume 0 != ~alive1~0 % 256; {60905#false} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {60905#false} assume !(node1_~m1~0#1 > ~id1~0); {60905#false} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {60905#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {60905#false} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {60905#false} ~mode1~0 := 0; {60905#false} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {60905#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60905#false} is VALID [2022-02-20 18:27:07,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {60905#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {60905#false} assume !(node2_~m2~0#1 != ~nomsg~0); {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {60905#false} ~mode2~0 := 0; {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {60905#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {60905#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {60905#false} assume !(node3_~m3~0#1 != ~nomsg~0); {60905#false} is VALID [2022-02-20 18:27:07,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {60905#false} ~mode3~0 := 0; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {60905#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {60905#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {60905#false} check_#res#1 := check_~tmp~1#1; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {60905#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {60905#false} assume 0 == assert_~arg#1 % 256; {60905#false} is VALID [2022-02-20 18:27:07,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {60905#false} assume !false; {60905#false} is VALID [2022-02-20 18:27:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:07,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:07,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075620923] [2022-02-20 18:27:07,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075620923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:07,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:07,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:07,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053680774] [2022-02-20 18:27:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 67 [2022-02-20 18:27:07,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:07,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 18:27:07,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:07,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:07,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:07,844 INFO L87 Difference]: Start difference. First operand 4831 states and 6830 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 18:27:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:15,895 INFO L93 Difference]: Finished difference Result 11235 states and 15832 transitions. [2022-02-20 18:27:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 67 [2022-02-20 18:27:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 18:27:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 18:27:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 18:27:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 18:27:15,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2022-02-20 18:27:16,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:18,219 INFO L225 Difference]: With dead ends: 11235 [2022-02-20 18:27:18,219 INFO L226 Difference]: Without dead ends: 7825 [2022-02-20 18:27:18,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:18,224 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:18,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2022-02-20 18:27:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 7823. [2022-02-20 18:27:22,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:22,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7825 states. Second operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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-20 18:27:22,398 INFO L74 IsIncluded]: Start isIncluded. First operand 7825 states. Second operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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-20 18:27:22,404 INFO L87 Difference]: Start difference. First operand 7825 states. Second operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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-20 18:27:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,067 INFO L93 Difference]: Finished difference Result 7825 states and 10867 transitions. [2022-02-20 18:27:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 10867 transitions. [2022-02-20 18:27:24,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:24,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:24,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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 7825 states. [2022-02-20 18:27:24,114 INFO L87 Difference]: Start difference. First operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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 7825 states. [2022-02-20 18:27:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,859 INFO L93 Difference]: Finished difference Result 7825 states and 10867 transitions. [2022-02-20 18:27:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 10867 transitions. [2022-02-20 18:27:25,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:25,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7823 states, 7822 states have (on average 1.3891587829199694) internal successors, (10866), 7822 states have internal predecessors, (10866), 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-20 18:27:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 10866 transitions. [2022-02-20 18:27:27,887 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 10866 transitions. Word has length 67 [2022-02-20 18:27:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:27,887 INFO L470 AbstractCegarLoop]: Abstraction has 7823 states and 10866 transitions. [2022-02-20 18:27:27,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 18:27:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 10866 transitions. [2022-02-20 18:27:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:27:27,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:27,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:27:27,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:27:27,889 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash -297371507, now seen corresponding path program 1 times [2022-02-20 18:27:27,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:27,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535752387] [2022-02-20 18:27:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:27,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {99269#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; {99269#true} is VALID [2022-02-20 18:27:27,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {99269#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {99269#true} is VALID [2022-02-20 18:27:27,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {99269#true} assume 0 == ~r1~0; {99269#true} is VALID [2022-02-20 18:27:27,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {99269#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {99269#true} is VALID [2022-02-20 18:27:27,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {99269#true} assume ~id1~0 >= 0; {99269#true} is VALID [2022-02-20 18:27:27,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {99269#true} assume 0 == ~st1~0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {99271#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {99271#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {99271#(<= ~st1~0 0)} assume ~id2~0 >= 0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {99271#(<= ~st1~0 0)} assume 0 == ~st2~0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {99271#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {99271#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {99271#(<= ~st1~0 0)} assume ~id3~0 >= 0; {99271#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {99271#(<= ~st1~0 0)} assume 0 == ~st3~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~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;main_~i2~0#1 := 0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~alive2~0 % 256; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~alive2~0 % 256; {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {99272#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {99272#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:27,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {99273#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {99270#false} is VALID [2022-02-20 18:27:27,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {99270#false} check_#res#1 := check_~tmp~1#1; {99270#false} is VALID [2022-02-20 18:27:27,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {99270#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {99270#false} is VALID [2022-02-20 18:27:27,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {99270#false} assume 0 == assert_~arg#1 % 256; {99270#false} is VALID [2022-02-20 18:27:27,969 INFO L290 TraceCheckUtils]: 66: Hoare triple {99270#false} assume !false; {99270#false} is VALID [2022-02-20 18:27:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:27:27,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:27,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535752387] [2022-02-20 18:27:27,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535752387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:27,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:27,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:27,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974504365] [2022-02-20 18:27:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) Word has length 67 [2022-02-20 18:27:27,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:27,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-20 18:27:28,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:28,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:28,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:28,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:28,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:28,019 INFO L87 Difference]: Start difference. First operand 7823 states and 10866 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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)