./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.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.6.1.ufo.UNBOUNDED.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 dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:28:19,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:28:19,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:28:19,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:28:19,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:28:19,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:28:19,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:28:19,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:28:19,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:28:19,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:28:19,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:28:19,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:28:19,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:28:19,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:28:19,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:28:19,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:28:19,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:28:19,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:28:19,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:28:19,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:28:19,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:28:19,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:28:19,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:28:19,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:28:19,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:28:19,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:28:19,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:28:19,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:28:19,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:28:19,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:28:19,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:28:19,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:28:19,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:28:19,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:28:19,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:28:19,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:28:19,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:28:19,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:28:19,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:28:19,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:28:19,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:28:19,700 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:28:19,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:28:19,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:28:19,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:28:19,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:28:19,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:28:19,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:28:19,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:28:19,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:28:19,721 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:28:19,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:28:19,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:28:19,722 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:28:19,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:28:19,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:28:19,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:28:19,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:28:19,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:28:19,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:28:19,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:19,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:28:19,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:28:19,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:28:19,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:28:19,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:28:19,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:28:19,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:28:19,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:28:19,731 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 -> dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3 [2022-02-20 18:28:19,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:28:19,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:28:19,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:28:19,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:28:19,954 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:28:19,955 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.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:20,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667301437/46ecb8d1cc914e328a7da5f499ac4204/FLAGe544b2d38 [2022-02-20 18:28:20,439 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:28:20,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:20,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667301437/46ecb8d1cc914e328a7da5f499ac4204/FLAGe544b2d38 [2022-02-20 18:28:20,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667301437/46ecb8d1cc914e328a7da5f499ac4204 [2022-02-20 18:28:20,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:28:20,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:28:20,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:20,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:28:20,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:28:20,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4e9175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20, skipping insertion in model container [2022-02-20 18:28:20,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:28:20,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:28:20,743 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.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2022-02-20 18:28:20,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:20,751 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:28:20,817 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.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2022-02-20 18:28:20,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:20,849 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:28:20,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20 WrapperNode [2022-02-20 18:28:20,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:20,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:20,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:28:20,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:28:20,855 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:28:20" (1/1) ... [2022-02-20 18:28:20,862 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:28:20" (1/1) ... [2022-02-20 18:28:20,908 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 460 [2022-02-20 18:28:20,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:20,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:28:20,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:28:20,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:28:20,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:28:20,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:28:20,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:28:20,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:28:20,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (1/1) ... [2022-02-20 18:28:20,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:20,984 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:28:20,992 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:28:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:28:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:28:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:28:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:28:21,130 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:28:21,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:28:21,743 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:28:21,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:28:21,754 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:28:21,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:21 BoogieIcfgContainer [2022-02-20 18:28:21,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:28:21,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:28:21,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:28:21,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:28:21,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:28:20" (1/3) ... [2022-02-20 18:28:21,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:21, skipping insertion in model container [2022-02-20 18:28:21,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:20" (2/3) ... [2022-02-20 18:28:21,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:21, skipping insertion in model container [2022-02-20 18:28:21,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:21" (3/3) ... [2022-02-20 18:28:21,764 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:21,768 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:28:21,768 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:28:21,807 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:28:21,812 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:28:21,812 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:28:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.717241379310345) internal successors, (249), 146 states have internal predecessors, (249), 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:28:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:28:21,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:21,832 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] [2022-02-20 18:28:21,832 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1143199986, now seen corresponding path program 1 times [2022-02-20 18:28:21,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:21,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125035818] [2022-02-20 18:28:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:22,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {150#true} is VALID [2022-02-20 18:28:22,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {150#true} is VALID [2022-02-20 18:28:22,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:28:22,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {153#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:28:22,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:28:22,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {151#false} is VALID [2022-02-20 18:28:22,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {151#false} is VALID [2022-02-20 18:28:22,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#false} assume !false;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; {151#false} is VALID [2022-02-20 18:28:22,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} assume !(0 != ~mode1~0 % 256); {151#false} is VALID [2022-02-20 18:28:22,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !(0 != ~alive1~0 % 256); {151#false} is VALID [2022-02-20 18:28:22,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !(~send1~0 != ~id1~0); {151#false} is VALID [2022-02-20 18:28:22,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#false} ~mode1~0 := 1; {151#false} is VALID [2022-02-20 18:28:22,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:28:22,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} assume !(node2_~m2~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:28:22,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#false} ~mode2~0 := 0; {151#false} is VALID [2022-02-20 18:28:22,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:28:22,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {151#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {151#false} assume !(node3_~m3~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:28:22,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {151#false} ~mode3~0 := 0; {151#false} is VALID [2022-02-20 18:28:22,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {151#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {151#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {151#false} assume !(node4_~m4~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:28:22,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {151#false} ~mode4~0 := 0; {151#false} is VALID [2022-02-20 18:28:22,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {151#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {151#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {151#false} assume !(node5_~m5~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:28:22,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {151#false} ~mode5~0 := 0; {151#false} is VALID [2022-02-20 18:28:22,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {151#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:28:22,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {151#false} assume !(node6_~m6~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:28:22,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {151#false} ~mode6~0 := 0; {151#false} is VALID [2022-02-20 18:28:22,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {151#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {151#false} is VALID [2022-02-20 18:28:22,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {151#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {151#false} is VALID [2022-02-20 18:28:22,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {151#false} check_#res#1 := check_~tmp~1#1; {151#false} is VALID [2022-02-20 18:28:22,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {151#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {151#false} is VALID [2022-02-20 18:28:22,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {151#false} assume 0 == assert_~arg#1 % 256; {151#false} is VALID [2022-02-20 18:28:22,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 18:28:22,040 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:28:22,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:22,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125035818] [2022-02-20 18:28:22,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125035818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:22,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:22,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:22,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32498906] [2022-02-20 18:28:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2022-02-20 18:28:22,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:22,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:28:22,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:22,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:22,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:22,114 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.717241379310345) internal successors, (249), 146 states have internal predecessors, (249), 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 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:28:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,575 INFO L93 Difference]: Finished difference Result 247 states and 411 transitions. [2022-02-20 18:28:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:22,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2022-02-20 18:28:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:28:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 411 transitions. [2022-02-20 18:28:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:28:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 411 transitions. [2022-02-20 18:28:22,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 411 transitions. [2022-02-20 18:28:22,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:22,840 INFO L225 Difference]: With dead ends: 247 [2022-02-20 18:28:22,840 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:28:22,843 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:28:22,846 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 3 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:22,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 916 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:28:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 18:28:22,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:22,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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:28:22,878 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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:28:22,878 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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:28:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,887 INFO L93 Difference]: Finished difference Result 143 states and 201 transitions. [2022-02-20 18:28:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2022-02-20 18:28:22,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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 143 states. [2022-02-20 18:28:22,889 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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 143 states. [2022-02-20 18:28:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,894 INFO L93 Difference]: Finished difference Result 143 states and 201 transitions. [2022-02-20 18:28:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2022-02-20 18:28:22,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:22,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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:28:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2022-02-20 18:28:22,900 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 38 [2022-02-20 18:28:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:22,900 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2022-02-20 18:28:22,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:28:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2022-02-20 18:28:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:28:22,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:22,903 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, 1, 1, 1, 1, 1, 1, 1, 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:28:22,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:28:22,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1334845828, now seen corresponding path program 1 times [2022-02-20 18:28:22,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:22,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141944095] [2022-02-20 18:28:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:23,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {865#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {865#true} is VALID [2022-02-20 18:28:23,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {865#true} is VALID [2022-02-20 18:28:23,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {865#true} assume 0 == ~r1~0 % 256; {865#true} is VALID [2022-02-20 18:28:23,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {865#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {865#true} is VALID [2022-02-20 18:28:23,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {865#true} assume ~id1~0 >= 0; {865#true} is VALID [2022-02-20 18:28:23,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {865#true} assume 0 == ~st1~0; {865#true} is VALID [2022-02-20 18:28:23,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#true} assume ~send1~0 == ~id1~0; {865#true} is VALID [2022-02-20 18:28:23,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#true} assume 0 == ~mode1~0 % 256; {865#true} is VALID [2022-02-20 18:28:23,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#true} assume ~id2~0 >= 0; {865#true} is VALID [2022-02-20 18:28:23,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#true} assume 0 == ~st2~0; {865#true} is VALID [2022-02-20 18:28:23,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {865#true} assume ~send2~0 == ~id2~0; {865#true} is VALID [2022-02-20 18:28:23,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#true} assume 0 == ~mode2~0 % 256; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;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; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {867#(= (+ (* (- 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; {867#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {867#(= (+ (* (- 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; {866#false} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {866#false} assume !(node2_~m2~0#1 != ~nomsg~0); {866#false} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {866#false} ~mode2~0 := 0; {866#false} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {866#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; {866#false} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {866#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {866#false} assume !(node3_~m3~0#1 != ~nomsg~0); {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {866#false} ~mode3~0 := 0; {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {866#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {866#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {866#false} assume !(node4_~m4~0#1 != ~nomsg~0); {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {866#false} ~mode4~0 := 0; {866#false} is VALID [2022-02-20 18:28:23,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {866#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {866#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {866#false} assume !(node5_~m5~0#1 != ~nomsg~0); {866#false} is VALID [2022-02-20 18:28:23,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {866#false} ~mode5~0 := 0; {866#false} is VALID [2022-02-20 18:28:23,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {866#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {866#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {866#false} is VALID [2022-02-20 18:28:23,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {866#false} assume !(node6_~m6~0#1 != ~nomsg~0); {866#false} is VALID [2022-02-20 18:28:23,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {866#false} ~mode6~0 := 0; {866#false} is VALID [2022-02-20 18:28:23,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {866#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {866#false} is VALID [2022-02-20 18:28:23,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {866#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {866#false} is VALID [2022-02-20 18:28:23,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {866#false} check_#res#1 := check_~tmp~1#1; {866#false} is VALID [2022-02-20 18:28:23,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {866#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {866#false} is VALID [2022-02-20 18:28:23,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {866#false} assume 0 == assert_~arg#1 % 256; {866#false} is VALID [2022-02-20 18:28:23,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-02-20 18:28:23,069 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:28:23,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:23,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141944095] [2022-02-20 18:28:23,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141944095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:23,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:23,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:23,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617907079] [2022-02-20 18:28:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:28:23,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:23,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:23,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:23,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:23,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:23,133 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,394 INFO L93 Difference]: Finished difference Result 323 states and 489 transitions. [2022-02-20 18:28:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:28:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:23,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:28:23,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:23,717 INFO L225 Difference]: With dead ends: 323 [2022-02-20 18:28:23,718 INFO L226 Difference]: Without dead ends: 227 [2022-02-20 18:28:23,718 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:28:23,719 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 137 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 454 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:28:23,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 454 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-20 18:28:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2022-02-20 18:28:23,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:23,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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:28:23,729 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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:28:23,729 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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:28:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,735 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2022-02-20 18:28:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2022-02-20 18:28:23,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:23,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:23,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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 227 states. [2022-02-20 18:28:23,737 INFO L87 Difference]: Start difference. First operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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 227 states. [2022-02-20 18:28:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,745 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2022-02-20 18:28:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2022-02-20 18:28:23,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:23,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:23,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:23,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4866071428571428) internal successors, (333), 224 states have internal predecessors, (333), 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:28:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 333 transitions. [2022-02-20 18:28:23,753 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 333 transitions. Word has length 78 [2022-02-20 18:28:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:23,754 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 333 transitions. [2022-02-20 18:28:23,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 333 transitions. [2022-02-20 18:28:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:28:23,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:23,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:23,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:28:23,757 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1690434603, now seen corresponding path program 1 times [2022-02-20 18:28:23,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:23,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865267041] [2022-02-20 18:28:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:23,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1914#true} is VALID [2022-02-20 18:28:23,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1914#true} is VALID [2022-02-20 18:28:23,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {1914#true} assume 0 == ~r1~0 % 256; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {1914#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {1914#true} assume ~id1~0 >= 0; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {1914#true} assume 0 == ~st1~0; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#true} assume ~send1~0 == ~id1~0; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#true} assume 0 == ~mode1~0 % 256; {1914#true} is VALID [2022-02-20 18:28:23,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1914#true} assume ~id2~0 >= 0; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1914#true} assume 0 == ~st2~0; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1914#true} assume ~send2~0 == ~id2~0; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1914#true} assume 0 == ~mode2~0 % 256; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1914#true} assume ~id3~0 >= 0; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1914#true} assume 0 == ~st3~0; {1914#true} is VALID [2022-02-20 18:28:23,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1914#true} assume ~send3~0 == ~id3~0; {1914#true} is VALID [2022-02-20 18:28:23,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1914#true} assume 0 == ~mode3~0 % 256; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {1916#(= (+ (* (- 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; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {1916#(= (+ (* (- 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; {1916#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {1916#(= (+ (* (- 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; {1915#false} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {1915#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1915#false} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {1915#false} ~mode3~0 := 0; {1915#false} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {1915#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {1915#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {1915#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 64: Hoare triple {1915#false} ~mode4~0 := 0; {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {1915#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {1915#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {1915#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {1915#false} ~mode5~0 := 0; {1915#false} is VALID [2022-02-20 18:28:23,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {1915#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {1915#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {1915#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {1915#false} ~mode6~0 := 0; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {1915#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {1915#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {1915#false} check_#res#1 := check_~tmp~1#1; {1915#false} is VALID [2022-02-20 18:28:23,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {1915#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1915#false} is VALID [2022-02-20 18:28:23,903 INFO L290 TraceCheckUtils]: 77: Hoare triple {1915#false} assume 0 == assert_~arg#1 % 256; {1915#false} is VALID [2022-02-20 18:28:23,903 INFO L290 TraceCheckUtils]: 78: Hoare triple {1915#false} assume !false; {1915#false} is VALID [2022-02-20 18:28:23,903 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:28:23,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:23,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865267041] [2022-02-20 18:28:23,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865267041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:23,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:23,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:23,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24556905] [2022-02-20 18:28:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2022-02-20 18:28:23,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:23,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:28:23,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:23,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:23,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:23,957 INFO L87 Difference]: Start difference. First operand 225 states and 333 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:28:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,224 INFO L93 Difference]: Finished difference Result 557 states and 865 transitions. [2022-02-20 18:28:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2022-02-20 18:28:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:28:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:28:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:24,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:28:24,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:24,535 INFO L225 Difference]: With dead ends: 557 [2022-02-20 18:28:24,535 INFO L226 Difference]: Without dead ends: 379 [2022-02-20 18:28:24,536 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:28:24,537 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 132 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 445 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:28:24,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 445 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-02-20 18:28:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2022-02-20 18:28:24,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:24,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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:28:24,551 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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:28:24,551 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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:28:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,559 INFO L93 Difference]: Finished difference Result 379 states and 577 transitions. [2022-02-20 18:28:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 577 transitions. [2022-02-20 18:28:24,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:24,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:24,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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 379 states. [2022-02-20 18:28:24,561 INFO L87 Difference]: Start difference. First operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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 379 states. [2022-02-20 18:28:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,570 INFO L93 Difference]: Finished difference Result 379 states and 577 transitions. [2022-02-20 18:28:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 577 transitions. [2022-02-20 18:28:24,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:24,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:24,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:24,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 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:28:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 576 transitions. [2022-02-20 18:28:24,579 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 576 transitions. Word has length 79 [2022-02-20 18:28:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:24,579 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 576 transitions. [2022-02-20 18:28:24,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:28:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 576 transitions. [2022-02-20 18:28:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:28:24,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:24,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:24,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:28:24,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1185859852, now seen corresponding path program 1 times [2022-02-20 18:28:24,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:24,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458303558] [2022-02-20 18:28:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:24,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {3693#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {3693#true} is VALID [2022-02-20 18:28:24,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume 0 == ~r1~0 % 256; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {3693#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {3693#true} assume ~id1~0 >= 0; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {3693#true} assume 0 == ~st1~0; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {3693#true} assume ~send1~0 == ~id1~0; {3693#true} is VALID [2022-02-20 18:28:24,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {3693#true} assume 0 == ~mode1~0 % 256; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {3693#true} assume ~id2~0 >= 0; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {3693#true} assume 0 == ~st2~0; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {3693#true} assume ~send2~0 == ~id2~0; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {3693#true} assume 0 == ~mode2~0 % 256; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {3693#true} assume ~id3~0 >= 0; {3693#true} is VALID [2022-02-20 18:28:24,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {3693#true} assume 0 == ~st3~0; {3693#true} is VALID [2022-02-20 18:28:24,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {3693#true} assume ~send3~0 == ~id3~0; {3693#true} is VALID [2022-02-20 18:28:24,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3693#true} assume 0 == ~mode3~0 % 256; {3693#true} is VALID [2022-02-20 18:28:24,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {3693#true} assume ~id4~0 >= 0; {3693#true} is VALID [2022-02-20 18:28:24,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3693#true} assume 0 == ~st4~0; {3693#true} is VALID [2022-02-20 18:28:24,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {3693#true} assume ~send4~0 == ~id4~0; {3693#true} is VALID [2022-02-20 18:28:24,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {3693#true} assume 0 == ~mode4~0 % 256; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;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; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:24,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {3695#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3694#false} is VALID [2022-02-20 18:28:24,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {3694#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3694#false} is VALID [2022-02-20 18:28:24,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {3694#false} ~mode4~0 := 0; {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {3694#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 67: Hoare triple {3694#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {3694#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {3694#false} ~mode5~0 := 0; {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {3694#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3694#false} is VALID [2022-02-20 18:28:24,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {3694#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {3694#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {3694#false} ~mode6~0 := 0; {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {3694#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {3694#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {3694#false} check_#res#1 := check_~tmp~1#1; {3694#false} is VALID [2022-02-20 18:28:24,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {3694#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {3694#false} is VALID [2022-02-20 18:28:24,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {3694#false} assume 0 == assert_~arg#1 % 256; {3694#false} is VALID [2022-02-20 18:28:24,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-02-20 18:28:24,672 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:28:24,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:24,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458303558] [2022-02-20 18:28:24,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458303558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:24,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:24,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:24,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677022602] [2022-02-20 18:28:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2022-02-20 18:28:24,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:24,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:28:24,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:24,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:24,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:24,729 INFO L87 Difference]: Start difference. First operand 377 states and 576 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:28:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,962 INFO L93 Difference]: Finished difference Result 989 states and 1554 transitions. [2022-02-20 18:28:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2022-02-20 18:28:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:28:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:28:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:24,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:28:25,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:25,282 INFO L225 Difference]: With dead ends: 989 [2022-02-20 18:28:25,282 INFO L226 Difference]: Without dead ends: 659 [2022-02-20 18:28:25,283 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:28:25,283 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 127 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 436 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:28:25,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 436 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-02-20 18:28:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2022-02-20 18:28:25,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:25,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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:28:25,301 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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:28:25,302 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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:28:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:25,317 INFO L93 Difference]: Finished difference Result 659 states and 1021 transitions. [2022-02-20 18:28:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1021 transitions. [2022-02-20 18:28:25,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:25,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:25,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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 659 states. [2022-02-20 18:28:25,320 INFO L87 Difference]: Start difference. First operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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 659 states. [2022-02-20 18:28:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:25,334 INFO L93 Difference]: Finished difference Result 659 states and 1021 transitions. [2022-02-20 18:28:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1021 transitions. [2022-02-20 18:28:25,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:25,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:25,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:25,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.5548780487804879) internal successors, (1020), 656 states have internal predecessors, (1020), 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:28:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1020 transitions. [2022-02-20 18:28:25,351 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1020 transitions. Word has length 80 [2022-02-20 18:28:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:25,351 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 1020 transitions. [2022-02-20 18:28:25,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:28:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1020 transitions. [2022-02-20 18:28:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:28:25,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:25,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:25,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:28:25,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 600169947, now seen corresponding path program 1 times [2022-02-20 18:28:25,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:25,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525074909] [2022-02-20 18:28:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:25,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {6824#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {6824#true} is VALID [2022-02-20 18:28:25,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {6824#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6824#true} is VALID [2022-02-20 18:28:25,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {6824#true} assume 0 == ~r1~0 % 256; {6824#true} is VALID [2022-02-20 18:28:25,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {6824#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {6824#true} is VALID [2022-02-20 18:28:25,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {6824#true} assume ~id1~0 >= 0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {6824#true} assume 0 == ~st1~0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {6824#true} assume ~send1~0 == ~id1~0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {6824#true} assume 0 == ~mode1~0 % 256; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {6824#true} assume ~id2~0 >= 0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {6824#true} assume 0 == ~st2~0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {6824#true} assume ~send2~0 == ~id2~0; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {6824#true} assume 0 == ~mode2~0 % 256; {6824#true} is VALID [2022-02-20 18:28:25,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {6824#true} assume ~id3~0 >= 0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#true} assume 0 == ~st3~0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {6824#true} assume ~send3~0 == ~id3~0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {6824#true} assume 0 == ~mode3~0 % 256; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {6824#true} assume ~id4~0 >= 0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {6824#true} assume 0 == ~st4~0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {6824#true} assume ~send4~0 == ~id4~0; {6824#true} is VALID [2022-02-20 18:28:25,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {6824#true} assume 0 == ~mode4~0 % 256; {6824#true} is VALID [2022-02-20 18:28:25,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {6824#true} assume ~id5~0 >= 0; {6824#true} is VALID [2022-02-20 18:28:25,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {6824#true} assume 0 == ~st5~0; {6824#true} is VALID [2022-02-20 18:28:25,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {6824#true} assume ~send5~0 == ~id5~0; {6824#true} is VALID [2022-02-20 18:28:25,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {6824#true} assume 0 == ~mode5~0 % 256; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;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; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,421 INFO L290 TraceCheckUtils]: 66: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:25,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {6826#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {6825#false} assume !(node5_~m5~0#1 != ~nomsg~0); {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {6825#false} ~mode5~0 := 0; {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {6825#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {6825#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {6825#false} assume !(node6_~m6~0#1 != ~nomsg~0); {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {6825#false} ~mode6~0 := 0; {6825#false} is VALID [2022-02-20 18:28:25,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {6825#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6825#false} is VALID [2022-02-20 18:28:25,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {6825#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {6825#false} is VALID [2022-02-20 18:28:25,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {6825#false} check_#res#1 := check_~tmp~1#1; {6825#false} is VALID [2022-02-20 18:28:25,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {6825#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {6825#false} is VALID [2022-02-20 18:28:25,423 INFO L290 TraceCheckUtils]: 79: Hoare triple {6825#false} assume 0 == assert_~arg#1 % 256; {6825#false} is VALID [2022-02-20 18:28:25,423 INFO L290 TraceCheckUtils]: 80: Hoare triple {6825#false} assume !false; {6825#false} is VALID [2022-02-20 18:28:25,423 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:28:25,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:25,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525074909] [2022-02-20 18:28:25,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525074909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:25,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:25,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:25,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919859384] [2022-02-20 18:28:25,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2022-02-20 18:28:25,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:25,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:25,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:25,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:25,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:25,478 INFO L87 Difference]: Start difference. First operand 657 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:25,776 INFO L93 Difference]: Finished difference Result 1781 states and 2806 transitions. [2022-02-20 18:28:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2022-02-20 18:28:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:25,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:28:26,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:26,105 INFO L225 Difference]: With dead ends: 1781 [2022-02-20 18:28:26,105 INFO L226 Difference]: Without dead ends: 1171 [2022-02-20 18:28:26,106 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:28:26,107 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 122 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 427 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:28:26,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 427 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-02-20 18:28:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2022-02-20 18:28:26,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:26,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1171 states. Second operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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:28:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 1171 states. Second operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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:28:26,132 INFO L87 Difference]: Start difference. First operand 1171 states. Second operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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:28:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:26,170 INFO L93 Difference]: Finished difference Result 1171 states and 1825 transitions. [2022-02-20 18:28:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1825 transitions. [2022-02-20 18:28:26,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:26,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:26,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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 1171 states. [2022-02-20 18:28:26,174 INFO L87 Difference]: Start difference. First operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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 1171 states. [2022-02-20 18:28:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:26,211 INFO L93 Difference]: Finished difference Result 1171 states and 1825 transitions. [2022-02-20 18:28:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1825 transitions. [2022-02-20 18:28:26,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:26,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:26,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:26,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.5616438356164384) internal successors, (1824), 1168 states have internal predecessors, (1824), 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:28:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1824 transitions. [2022-02-20 18:28:26,255 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1824 transitions. Word has length 81 [2022-02-20 18:28:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1824 transitions. [2022-02-20 18:28:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1824 transitions. [2022-02-20 18:28:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:28:26,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:26,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:26,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:28:26,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1228760164, now seen corresponding path program 1 times [2022-02-20 18:28:26,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:26,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286939069] [2022-02-20 18:28:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:26,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {12443#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {12443#true} is VALID [2022-02-20 18:28:26,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {12443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12443#true} is VALID [2022-02-20 18:28:26,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {12443#true} assume 0 == ~r1~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {12443#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12443#true} is VALID [2022-02-20 18:28:26,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {12443#true} assume ~id1~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {12443#true} assume 0 == ~st1~0; {12443#true} is VALID [2022-02-20 18:28:26,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {12443#true} assume ~send1~0 == ~id1~0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {12443#true} assume 0 == ~mode1~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {12443#true} assume ~id2~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {12443#true} assume 0 == ~st2~0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {12443#true} assume ~send2~0 == ~id2~0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {12443#true} assume 0 == ~mode2~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {12443#true} assume ~id3~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {12443#true} assume 0 == ~st3~0; {12443#true} is VALID [2022-02-20 18:28:26,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {12443#true} assume ~send3~0 == ~id3~0; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {12443#true} assume 0 == ~mode3~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {12443#true} assume ~id4~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {12443#true} assume 0 == ~st4~0; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {12443#true} assume ~send4~0 == ~id4~0; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {12443#true} assume 0 == ~mode4~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {12443#true} assume ~id5~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {12443#true} assume 0 == ~st5~0; {12443#true} is VALID [2022-02-20 18:28:26,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {12443#true} assume ~send5~0 == ~id5~0; {12443#true} is VALID [2022-02-20 18:28:26,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {12443#true} assume 0 == ~mode5~0 % 256; {12443#true} is VALID [2022-02-20 18:28:26,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {12443#true} assume ~id6~0 >= 0; {12443#true} is VALID [2022-02-20 18:28:26,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {12443#true} assume 0 == ~st6~0; {12443#true} is VALID [2022-02-20 18:28:26,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {12443#true} assume ~send6~0 == ~id6~0; {12443#true} is VALID [2022-02-20 18:28:26,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {12443#true} assume 0 == ~mode6~0 % 256; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;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; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive1~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~id1~0); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode1~0 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive2~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,334 INFO L290 TraceCheckUtils]: 55: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~id2~0); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode2~0 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive3~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~id3~0); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode3~0 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive4~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~id4~0); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode4~0 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive5~0 % 256); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~id5~0); {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode5~0 := 1; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 73: Hoare triple {12445#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 74: Hoare triple {12444#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {12444#false} ~mode6~0 := 0; {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 76: Hoare triple {12444#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {12444#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {12444#false} check_#res#1 := check_~tmp~1#1; {12444#false} is VALID [2022-02-20 18:28:26,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {12444#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {12444#false} is VALID [2022-02-20 18:28:26,343 INFO L290 TraceCheckUtils]: 80: Hoare triple {12444#false} assume 0 == assert_~arg#1 % 256; {12444#false} is VALID [2022-02-20 18:28:26,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {12444#false} assume !false; {12444#false} is VALID [2022-02-20 18:28:26,343 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:28:26,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:26,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286939069] [2022-02-20 18:28:26,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286939069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:26,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:26,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:26,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629159070] [2022-02-20 18:28:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2022-02-20 18:28:26,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:26,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:28:26,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:26,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:26,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:26,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:26,386 INFO L87 Difference]: Start difference. First operand 1169 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:28:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:26,913 INFO L93 Difference]: Finished difference Result 3221 states and 5058 transitions. [2022-02-20 18:28:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2022-02-20 18:28:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:28:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:28:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:28:26,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:28:27,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:27,361 INFO L225 Difference]: With dead ends: 3221 [2022-02-20 18:28:27,362 INFO L226 Difference]: Without dead ends: 2099 [2022-02-20 18:28:27,362 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:28:27,363 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 117 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 418 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:28:27,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 418 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2022-02-20 18:28:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2097. [2022-02-20 18:28:27,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:27,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2099 states. Second operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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:28:27,407 INFO L74 IsIncluded]: Start isIncluded. First operand 2099 states. Second operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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:28:27,410 INFO L87 Difference]: Start difference. First operand 2099 states. Second operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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:28:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:27,524 INFO L93 Difference]: Finished difference Result 2099 states and 3265 transitions. [2022-02-20 18:28:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3265 transitions. [2022-02-20 18:28:27,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:27,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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 2099 states. [2022-02-20 18:28:27,533 INFO L87 Difference]: Start difference. First operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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 2099 states. [2022-02-20 18:28:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:27,655 INFO L93 Difference]: Finished difference Result 2099 states and 3265 transitions. [2022-02-20 18:28:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3265 transitions. [2022-02-20 18:28:27,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:27,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:27,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:27,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 1.5572519083969465) internal successors, (3264), 2096 states have internal predecessors, (3264), 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:28:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3264 transitions. [2022-02-20 18:28:27,797 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3264 transitions. Word has length 82 [2022-02-20 18:28:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:27,797 INFO L470 AbstractCegarLoop]: Abstraction has 2097 states and 3264 transitions. [2022-02-20 18:28:27,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:28:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3264 transitions. [2022-02-20 18:28:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:28:27,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:27,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:27,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:28:27,800 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -991115381, now seen corresponding path program 1 times [2022-02-20 18:28:27,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:27,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748453497] [2022-02-20 18:28:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:27,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {22606#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {22606#true} is VALID [2022-02-20 18:28:27,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {22606#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22606#true} is VALID [2022-02-20 18:28:27,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {22606#true} assume 0 == ~r1~0 % 256; {22606#true} is VALID [2022-02-20 18:28:27,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {22606#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {22606#true} is VALID [2022-02-20 18:28:27,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {22606#true} assume ~id1~0 >= 0; {22606#true} is VALID [2022-02-20 18:28:27,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {22606#true} assume 0 == ~st1~0; {22608#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:27,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {22608#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {22608#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:27,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {22608#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {22608#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:27,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {22608#(<= ~st1~0 0)} assume ~id2~0 >= 0; {22608#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:27,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {22608#(<= ~st1~0 0)} assume 0 == ~st2~0; {22609#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {22609#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {22609#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {22609#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22609#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {22609#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {22609#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {22609#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {22610#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {22611#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:27,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {22612#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !false;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; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive1~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~id1~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive2~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive3~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive4~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive5~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive6~0 % 256); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:27,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {22613#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {22607#false} is VALID [2022-02-20 18:28:27,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {22607#false} check_#res#1 := check_~tmp~1#1; {22607#false} is VALID [2022-02-20 18:28:27,922 INFO L290 TraceCheckUtils]: 80: Hoare triple {22607#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {22607#false} is VALID [2022-02-20 18:28:27,922 INFO L290 TraceCheckUtils]: 81: Hoare triple {22607#false} assume 0 == assert_~arg#1 % 256; {22607#false} is VALID [2022-02-20 18:28:27,922 INFO L290 TraceCheckUtils]: 82: Hoare triple {22607#false} assume !false; {22607#false} is VALID [2022-02-20 18:28:27,922 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:28:27,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:27,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748453497] [2022-02-20 18:28:27,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748453497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:27,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:27,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:28:27,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468147350] [2022-02-20 18:28:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2022-02-20 18:28:27,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:27,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:28:27,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:27,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:28:27,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:28:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:27,979 INFO L87 Difference]: Start difference. First operand 2097 states and 3264 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:28:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:40,790 INFO L93 Difference]: Finished difference Result 16447 states and 25783 transitions. [2022-02-20 18:28:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:28:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2022-02-20 18:28:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:28:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1279 transitions. [2022-02-20 18:28:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:28:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1279 transitions. [2022-02-20 18:28:40,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1279 transitions. [2022-02-20 18:28:41,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1279 edges. 1279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:47,712 INFO L225 Difference]: With dead ends: 16447 [2022-02-20 18:28:47,712 INFO L226 Difference]: Without dead ends: 14397 [2022-02-20 18:28:47,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:28:47,717 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 1801 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:47,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1801 Valid, 3241 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:28:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14397 states. [2022-02-20 18:28:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14397 to 4145. [2022-02-20 18:28:49,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:49,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14397 states. Second operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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:28:49,442 INFO L74 IsIncluded]: Start isIncluded. First operand 14397 states. Second operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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:28:49,460 INFO L87 Difference]: Start difference. First operand 14397 states. Second operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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:28:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,073 INFO L93 Difference]: Finished difference Result 14397 states and 22502 transitions. [2022-02-20 18:28:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14397 states and 22502 transitions. [2022-02-20 18:28:55,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:55,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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 14397 states. [2022-02-20 18:28:55,131 INFO L87 Difference]: Start difference. First operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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 14397 states. [2022-02-20 18:29:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:01,457 INFO L93 Difference]: Finished difference Result 14397 states and 22502 transitions. [2022-02-20 18:29:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14397 states and 22502 transitions. [2022-02-20 18:29:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:01,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:01,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:01,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 4144 states have (on average 1.5482625482625483) internal successors, (6416), 4144 states have internal predecessors, (6416), 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:29:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6416 transitions. [2022-02-20 18:29:02,160 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6416 transitions. Word has length 83 [2022-02-20 18:29:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:02,160 INFO L470 AbstractCegarLoop]: Abstraction has 4145 states and 6416 transitions. [2022-02-20 18:29:02,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:29:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6416 transitions. [2022-02-20 18:29:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:29:02,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:02,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:02,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:02,162 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1043128834, now seen corresponding path program 1 times [2022-02-20 18:29:02,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:02,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48744699] [2022-02-20 18:29:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:02,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {74575#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {74575#true} is VALID [2022-02-20 18:29:02,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {74575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {74575#true} is VALID [2022-02-20 18:29:02,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {74575#true} assume 0 == ~r1~0 % 256; {74575#true} is VALID [2022-02-20 18:29:02,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {74575#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id6~0 >= 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send6~0 == ~id6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode6~0 % 256; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id6~0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == assume_abort_if_not_~cond#1); {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !false;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; {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:29:02,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {74577#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:29:02,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:29:02,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:29:02,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~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; {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:29:02,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:29:02,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {74578#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:29:02,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:29:02,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:29:02,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~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; {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:29:02,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:29:02,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {74579#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:29:02,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:29:02,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:29:02,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:29:02,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(0 != ~mode4~0 % 256); {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:29:02,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {74580#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(0 != ~alive4~0 % 256); {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:29:02,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(~send4~0 != ~id4~0); {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:29:02,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} ~mode4~0 := 1; {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:29:02,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:29:02,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(0 != ~mode5~0 % 256); {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:29:02,345 INFO L290 TraceCheckUtils]: 69: Hoare triple {74581#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(0 != ~alive5~0 % 256); {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:29:02,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(~send5~0 != ~id5~0); {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:29:02,345 INFO L290 TraceCheckUtils]: 71: Hoare triple {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} ~mode5~0 := 1; {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:29:02,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:29:02,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(0 != ~mode6~0 % 256); {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:29:02,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {74582#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(0 != ~alive6~0 % 256); {74576#false} is VALID [2022-02-20 18:29:02,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {74576#false} assume !(~send6~0 != ~id6~0); {74576#false} is VALID [2022-02-20 18:29:02,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {74576#false} ~mode6~0 := 1; {74576#false} is VALID [2022-02-20 18:29:02,346 INFO L290 TraceCheckUtils]: 77: Hoare triple {74576#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {74576#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {74576#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {74576#false} check_#res#1 := check_~tmp~1#1; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {74576#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {74576#false} assume 0 == assert_~arg#1 % 256; {74576#false} is VALID [2022-02-20 18:29:02,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {74576#false} assume !false; {74576#false} is VALID [2022-02-20 18:29:02,348 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:29:02,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:02,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48744699] [2022-02-20 18:29:02,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48744699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:02,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:02,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:02,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32284424] [2022-02-20 18:29:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 84 [2022-02-20 18:29:02,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:02,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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:29:02,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:02,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:02,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:02,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:02,418 INFO L87 Difference]: Start difference. First operand 4145 states and 6416 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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)