./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.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 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:42:15,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:42:15,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:42:15,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:42:15,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:42:15,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:42:15,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:42:15,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:42:15,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:42:15,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:42:15,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:42:15,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:42:15,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:42:15,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:42:15,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:42:15,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:42:15,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:42:15,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:42:15,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:42:15,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:42:15,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:42:15,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:42:15,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:42:15,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:42:15,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:42:15,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:42:15,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:42:15,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:42:15,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:42:15,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:42:15,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:42:15,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:42:15,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:42:15,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:42:15,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:42:15,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:42:15,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:42:15,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:42:15,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:42:15,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:42:15,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:42:15,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:42:15,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:42:15,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:42:15,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:42:15,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:42:15,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:42:15,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:42:15,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:42:15,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:42:15,991 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:42:15,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:42:15,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:42:15,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:42:15,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:42:15,993 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:42:15,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:42:15,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:42:15,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:42:15,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:42:15,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:15,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:42:15,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:42:15,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:42:15,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:42:15,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:42:15,995 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:42:15,995 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:42:15,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:42:15,996 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 -> 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 [2022-02-20 19:42:16,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:42:16,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:42:16,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:42:16,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:42:16,237 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:42:16,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2022-02-20 19:42:16,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9245bc/6d2b3d0967a6439c9b4b5cdbcab7ea2f/FLAGbb2a72e08 [2022-02-20 19:42:16,840 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:42:16,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2022-02-20 19:42:16,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9245bc/6d2b3d0967a6439c9b4b5cdbcab7ea2f/FLAGbb2a72e08 [2022-02-20 19:42:17,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9245bc/6d2b3d0967a6439c9b4b5cdbcab7ea2f [2022-02-20 19:42:17,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:42:17,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:42:17,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:17,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:42:17,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:42:17,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:17" (1/1) ... [2022-02-20 19:42:17,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efa1542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:17, skipping insertion in model container [2022-02-20 19:42:17,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:17" (1/1) ... [2022-02-20 19:42:17,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:42:17,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:42:17,725 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2022-02-20 19:42:17,755 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2022-02-20 19:42:18,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:18,252 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:42:18,285 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2022-02-20 19:42:18,301 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2022-02-20 19:42:18,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:18,732 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:42:18,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18 WrapperNode [2022-02-20 19:42:18,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:18,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:18,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:42:18,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:42:18,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:18,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,124 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2022-02-20 19:42:19,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:19,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:42:19,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:42:19,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:42:19,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:42:19,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:42:19,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:42:19,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:42:19,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (1/1) ... [2022-02-20 19:42:19,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:42:19,589 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 19:42:19,644 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 19:42:19,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:42:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:42:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:42:19,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:42:19,806 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:42:19,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:42:26,293 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:42:26,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:42:26,311 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:42:26,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:26 BoogieIcfgContainer [2022-02-20 19:42:26,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:42:26,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:42:26,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:42:26,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:42:26,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:42:17" (1/3) ... [2022-02-20 19:42:26,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65197fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:26, skipping insertion in model container [2022-02-20 19:42:26,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:18" (2/3) ... [2022-02-20 19:42:26,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65197fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:26, skipping insertion in model container [2022-02-20 19:42:26,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:26" (3/3) ... [2022-02-20 19:42:26,320 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2022-02-20 19:42:26,324 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:42:26,325 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:42:26,365 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:42:26,372 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 19:42:26,373 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:42:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 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 19:42:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 19:42:26,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:26,412 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] [2022-02-20 19:42:26,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1466745723, now seen corresponding path program 1 times [2022-02-20 19:42:26,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:26,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478645288] [2022-02-20 19:42:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:26,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {898#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet40#1, main2_#t~ret41#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet40#1 && main2_#t~nondet40#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet40#1;havoc main2_#t~nondet40#1; {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret37#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {900#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:42:26,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {900#(<= (+ ~a17~0 124) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {899#false} is VALID [2022-02-20 19:42:26,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 19:42:26,619 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 19:42:26,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:26,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478645288] [2022-02-20 19:42:26,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478645288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:26,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:26,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:42:26,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914282930] [2022-02-20 19:42:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:42:26,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:26,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 19:42:26,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:26,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:26,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:26,665 INFO L87 Difference]: Start difference. First operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 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 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 19:42:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:32,109 INFO L93 Difference]: Finished difference Result 2530 states and 4854 transitions. [2022-02-20 19:42:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:42:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 19:42:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4854 transitions. [2022-02-20 19:42:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 19:42:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4854 transitions. [2022-02-20 19:42:32,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4854 transitions. [2022-02-20 19:42:35,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4854 edges. 4854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:35,817 INFO L225 Difference]: With dead ends: 2530 [2022-02-20 19:42:35,818 INFO L226 Difference]: Without dead ends: 1580 [2022-02-20 19:42:35,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:42:35,828 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 925 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:35,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [925 Valid, 651 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:42:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2022-02-20 19:42:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2022-02-20 19:42:35,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:35,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 19:42:35,918 INFO L74 IsIncluded]: Start isIncluded. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 19:42:35,921 INFO L87 Difference]: Start difference. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 19:42:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:36,003 INFO L93 Difference]: Finished difference Result 1580 states and 2542 transitions. [2022-02-20 19:42:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2542 transitions. [2022-02-20 19:42:36,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:36,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:42:36,019 INFO L87 Difference]: Start difference. First operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:42:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:36,102 INFO L93 Difference]: Finished difference Result 1580 states and 2542 transitions. [2022-02-20 19:42:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2542 transitions. [2022-02-20 19:42:36,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:36,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:36,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:36,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1578 states have (on average 1.6108998732572877) internal successors, (2542), 1579 states have internal predecessors, (2542), 0 states have call successors, (0), 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 19:42:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2542 transitions. [2022-02-20 19:42:36,190 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2542 transitions. Word has length 20 [2022-02-20 19:42:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:36,191 INFO L470 AbstractCegarLoop]: Abstraction has 1580 states and 2542 transitions. [2022-02-20 19:42:36,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 19:42:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2542 transitions. [2022-02-20 19:42:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:36,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:36,195 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] [2022-02-20 19:42:36,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:42:36,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1951091139, now seen corresponding path program 1 times [2022-02-20 19:42:36,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:36,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802131788] [2022-02-20 19:42:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:36,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {8225#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8225#true} is VALID [2022-02-20 19:42:36,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {8225#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8225#true} is VALID [2022-02-20 19:42:36,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {8225#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8225#true} is VALID [2022-02-20 19:42:36,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {8225#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8227#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:42:36,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {8227#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8228#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:42:36,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {8228#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8229#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:42:36,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {8229#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8226#false} is VALID [2022-02-20 19:42:36,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {8226#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;main1_~i2~0#1 := 0; {8226#false} is VALID [2022-02-20 19:42:36,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {8226#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8226#false} is VALID [2022-02-20 19:42:36,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {8226#false} assume !(0 != ~mode1~0 % 256); {8226#false} is VALID [2022-02-20 19:42:36,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {8226#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8226#false} is VALID [2022-02-20 19:42:36,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {8226#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8226#false} is VALID [2022-02-20 19:42:36,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {8226#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8226#false} is VALID [2022-02-20 19:42:36,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {8226#false} assume !(0 != ~mode2~0 % 256); {8226#false} is VALID [2022-02-20 19:42:36,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {8226#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8226#false} is VALID [2022-02-20 19:42:36,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {8226#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {8226#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {8226#false} assume !(0 != ~mode3~0 % 256); {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {8226#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {8226#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {8226#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8226#false} is VALID [2022-02-20 19:42:36,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {8226#false} assume !(0 != ~mode4~0 % 256); {8226#false} is VALID [2022-02-20 19:42:36,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {8226#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8226#false} is VALID [2022-02-20 19:42:36,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {8226#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8226#false} is VALID [2022-02-20 19:42:36,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {8226#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8226#false} is VALID [2022-02-20 19:42:36,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {8226#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8226#false} is VALID [2022-02-20 19:42:36,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {8226#false} check_#res#1 := check_~tmp~1#1; {8226#false} is VALID [2022-02-20 19:42:36,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {8226#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8226#false} is VALID [2022-02-20 19:42:36,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {8226#false} assume 0 == assert_~arg#1 % 256; {8226#false} is VALID [2022-02-20 19:42:36,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {8226#false} assume !false; {8226#false} is VALID [2022-02-20 19:42:36,299 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 19:42:36,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:36,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802131788] [2022-02-20 19:42:36,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802131788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:36,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:36,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:36,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916051989] [2022-02-20 19:42:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:36,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:36,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:42:36,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:36,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:42:36,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:42:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:42:36,321 INFO L87 Difference]: Start difference. First operand 1580 states and 2542 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:42:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:39,963 INFO L93 Difference]: Finished difference Result 1630 states and 2618 transitions. [2022-02-20 19:42:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:42:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:42:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:42:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:39,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1639 transitions. [2022-02-20 19:42:41,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1639 edges. 1639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:41,214 INFO L225 Difference]: With dead ends: 1630 [2022-02-20 19:42:41,214 INFO L226 Difference]: Without dead ends: 1580 [2022-02-20 19:42:41,217 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 19:42:41,219 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 3 mSDsluCounter, 4657 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:41,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2022-02-20 19:42:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2022-02-20 19:42:41,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:41,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 19:42:41,248 INFO L74 IsIncluded]: Start isIncluded. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 19:42:41,251 INFO L87 Difference]: Start difference. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 19:42:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:41,330 INFO L93 Difference]: Finished difference Result 1580 states and 2519 transitions. [2022-02-20 19:42:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2519 transitions. [2022-02-20 19:42:41,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:41,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:41,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:42:41,337 INFO L87 Difference]: Start difference. First operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:42:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:41,413 INFO L93 Difference]: Finished difference Result 1580 states and 2519 transitions. [2022-02-20 19:42:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2519 transitions. [2022-02-20 19:42:41,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:41,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:41,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:41,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1578 states have (on average 1.5963244613434728) internal successors, (2519), 1579 states have internal predecessors, (2519), 0 states have call successors, (0), 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 19:42:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2519 transitions. [2022-02-20 19:42:41,494 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2519 transitions. Word has length 30 [2022-02-20 19:42:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:41,495 INFO L470 AbstractCegarLoop]: Abstraction has 1580 states and 2519 transitions. [2022-02-20 19:42:41,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:42:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2519 transitions. [2022-02-20 19:42:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:41,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:41,497 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] [2022-02-20 19:42:41,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:42:41,498 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:41,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash 568524862, now seen corresponding path program 1 times [2022-02-20 19:42:41,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:41,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410871451] [2022-02-20 19:42:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:41,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {14650#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14650#true} is VALID [2022-02-20 19:42:41,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {14650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {14650#true} is VALID [2022-02-20 19:42:41,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {14650#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14650#true} is VALID [2022-02-20 19:42:41,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {14650#true} assume 0 == ~r1~0 % 256; {14650#true} is VALID [2022-02-20 19:42:41,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {14650#true} assume ~id1~0 >= 0; {14650#true} is VALID [2022-02-20 19:42:41,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {14650#true} assume 0 == ~st1~0; {14652#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:41,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {14652#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {14652#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:41,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {14652#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {14652#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:41,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {14652#(<= ~st1~0 0)} assume ~id2~0 >= 0; {14652#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:41,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {14652#(<= ~st1~0 0)} assume 0 == ~st2~0; {14653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {14653#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {14653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {14653#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {14653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {14653#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {14653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {14653#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {14654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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;main1_~i2~0#1 := 0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:41,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {14655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {14651#false} is VALID [2022-02-20 19:42:41,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {14651#false} check_#res#1 := check_~tmp~1#1; {14651#false} is VALID [2022-02-20 19:42:41,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {14651#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14651#false} is VALID [2022-02-20 19:42:41,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {14651#false} assume 0 == assert_~arg#1 % 256; {14651#false} is VALID [2022-02-20 19:42:41,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {14651#false} assume !false; {14651#false} is VALID [2022-02-20 19:42:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:41,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:41,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410871451] [2022-02-20 19:42:41,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410871451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:41,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:41,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:41,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963989670] [2022-02-20 19:42:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:41,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:41,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:41,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:42:41,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:41,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:41,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:41,689 INFO L87 Difference]: Start difference. First operand 1580 states and 2519 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:42:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:44,688 INFO L93 Difference]: Finished difference Result 1948 states and 3095 transitions. [2022-02-20 19:42:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:42:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:42:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:42:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:42:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:42:44,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2116 transitions. [2022-02-20 19:42:46,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2116 edges. 2116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:46,394 INFO L225 Difference]: With dead ends: 1948 [2022-02-20 19:42:46,394 INFO L226 Difference]: Without dead ends: 1902 [2022-02-20 19:42:46,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:42:46,399 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 6574 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6574 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:46,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6574 Valid, 2078 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-02-20 19:42:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1624. [2022-02-20 19:42:46,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:46,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 19:42:46,484 INFO L74 IsIncluded]: Start isIncluded. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 19:42:46,487 INFO L87 Difference]: Start difference. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 19:42:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:46,586 INFO L93 Difference]: Finished difference Result 1902 states and 3015 transitions. [2022-02-20 19:42:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3015 transitions. [2022-02-20 19:42:46,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:46,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:46,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1902 states. [2022-02-20 19:42:46,623 INFO L87 Difference]: Start difference. First operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1902 states. [2022-02-20 19:42:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:46,728 INFO L93 Difference]: Finished difference Result 1902 states and 3015 transitions. [2022-02-20 19:42:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3015 transitions. [2022-02-20 19:42:46,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:46,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:46,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:46,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.595561035758323) internal successors, (2588), 1623 states have internal predecessors, (2588), 0 states have call successors, (0), 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 19:42:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2588 transitions. [2022-02-20 19:42:46,813 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2588 transitions. Word has length 52 [2022-02-20 19:42:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:46,813 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2588 transitions. [2022-02-20 19:42:46,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:42:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2588 transitions. [2022-02-20 19:42:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:46,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:46,814 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] [2022-02-20 19:42:46,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:42:46,815 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -524152242, now seen corresponding path program 1 times [2022-02-20 19:42:46,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:46,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714152549] [2022-02-20 19:42:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:46,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {22144#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22144#true} is VALID [2022-02-20 19:42:46,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {22144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {22144#true} is VALID [2022-02-20 19:42:46,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {22144#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22144#true} is VALID [2022-02-20 19:42:46,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {22144#true} assume 0 == ~r1~0 % 256; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;main1_~i2~0#1 := 0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:46,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {22146#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {22145#false} is VALID [2022-02-20 19:42:46,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {22145#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {22145#false} is VALID [2022-02-20 19:42:46,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {22145#false} check_#res#1 := check_~tmp~1#1; {22145#false} is VALID [2022-02-20 19:42:46,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {22145#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22145#false} is VALID [2022-02-20 19:42:46,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {22145#false} assume 0 == assert_~arg#1 % 256; {22145#false} is VALID [2022-02-20 19:42:46,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {22145#false} assume !false; {22145#false} is VALID [2022-02-20 19:42:46,923 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 19:42:46,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:46,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714152549] [2022-02-20 19:42:46,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714152549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:46,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:46,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:46,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221070147] [2022-02-20 19:42:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:46,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:46,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:46,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:46,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:46,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:46,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:46,963 INFO L87 Difference]: Start difference. First operand 1624 states and 2588 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:48,351 INFO L93 Difference]: Finished difference Result 1793 states and 2851 transitions. [2022-02-20 19:42:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:42:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:42:48,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1675 transitions. [2022-02-20 19:42:49,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:49,709 INFO L225 Difference]: With dead ends: 1793 [2022-02-20 19:42:49,709 INFO L226 Difference]: Without dead ends: 1703 [2022-02-20 19:42:49,710 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 19:42:49,710 INFO L933 BasicCegarLoop]: 1536 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:49,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-02-20 19:42:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1699. [2022-02-20 19:42:49,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:49,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 19:42:49,808 INFO L74 IsIncluded]: Start isIncluded. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 19:42:49,810 INFO L87 Difference]: Start difference. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 19:42:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:49,890 INFO L93 Difference]: Finished difference Result 1703 states and 2705 transitions. [2022-02-20 19:42:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2705 transitions. [2022-02-20 19:42:49,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:49,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:49,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 1703 states. [2022-02-20 19:42:49,897 INFO L87 Difference]: Start difference. First operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 1703 states. [2022-02-20 19:42:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:49,981 INFO L93 Difference]: Finished difference Result 1703 states and 2705 transitions. [2022-02-20 19:42:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2705 transitions. [2022-02-20 19:42:49,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:49,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:49,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:49,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.5922215674720095) internal successors, (2702), 1698 states have internal predecessors, (2702), 0 states have call successors, (0), 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 19:42:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2702 transitions. [2022-02-20 19:42:50,090 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2702 transitions. Word has length 54 [2022-02-20 19:42:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:50,091 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2702 transitions. [2022-02-20 19:42:50,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2702 transitions. [2022-02-20 19:42:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:50,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:50,092 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] [2022-02-20 19:42:50,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:42:50,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash -457658730, now seen corresponding path program 1 times [2022-02-20 19:42:50,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:50,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669586565] [2022-02-20 19:42:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:50,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {29137#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29137#true} is VALID [2022-02-20 19:42:50,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {29137#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {29137#true} is VALID [2022-02-20 19:42:50,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {29137#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29137#true} is VALID [2022-02-20 19:42:50,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {29137#true} assume 0 == ~r1~0 % 256; {29137#true} is VALID [2022-02-20 19:42:50,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {29137#true} assume ~id1~0 >= 0; {29137#true} is VALID [2022-02-20 19:42:50,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {29137#true} assume 0 == ~st1~0; {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:50,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:50,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:50,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:50,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {29139#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:50,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:50,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:50,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:50,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {29140#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:50,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:50,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:50,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:50,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {29141#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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;main1_~i2~0#1 := 0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:50,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {29142#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {29138#false} is VALID [2022-02-20 19:42:50,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {29138#false} check_#res#1 := check_~tmp~1#1; {29138#false} is VALID [2022-02-20 19:42:50,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {29138#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29138#false} is VALID [2022-02-20 19:42:50,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {29138#false} assume 0 == assert_~arg#1 % 256; {29138#false} is VALID [2022-02-20 19:42:50,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {29138#false} assume !false; {29138#false} is VALID [2022-02-20 19:42:50,244 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 19:42:50,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:50,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669586565] [2022-02-20 19:42:50,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669586565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:50,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:50,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:50,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296214072] [2022-02-20 19:42:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:50,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:50,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:50,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:50,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:50,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:50,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:50,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:50,289 INFO L87 Difference]: Start difference. First operand 1699 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:52,240 INFO L93 Difference]: Finished difference Result 1866 states and 2958 transitions. [2022-02-20 19:42:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:42:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:42:52,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1682 transitions. [2022-02-20 19:42:53,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1682 edges. 1682 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:53,657 INFO L225 Difference]: With dead ends: 1866 [2022-02-20 19:42:53,658 INFO L226 Difference]: Without dead ends: 1701 [2022-02-20 19:42:53,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:42:53,659 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 1593 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:53,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1593 Valid, 1814 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2022-02-20 19:42:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1699. [2022-02-20 19:42:53,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:53,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 19:42:53,765 INFO L74 IsIncluded]: Start isIncluded. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 19:42:53,766 INFO L87 Difference]: Start difference. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 19:42:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:53,849 INFO L93 Difference]: Finished difference Result 1701 states and 2701 transitions. [2022-02-20 19:42:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2701 transitions. [2022-02-20 19:42:53,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:53,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:53,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 1701 states. [2022-02-20 19:42:53,855 INFO L87 Difference]: Start difference. First operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 1701 states. [2022-02-20 19:42:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:53,934 INFO L93 Difference]: Finished difference Result 1701 states and 2701 transitions. [2022-02-20 19:42:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2701 transitions. [2022-02-20 19:42:53,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:53,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:53,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:53,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.5910430170889807) internal successors, (2700), 1698 states have internal predecessors, (2700), 0 states have call successors, (0), 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 19:42:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2700 transitions. [2022-02-20 19:42:54,021 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2700 transitions. Word has length 54 [2022-02-20 19:42:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:54,021 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2700 transitions. [2022-02-20 19:42:54,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2700 transitions. [2022-02-20 19:42:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:54,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:54,022 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] [2022-02-20 19:42:54,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:42:54,022 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1331255346, now seen corresponding path program 1 times [2022-02-20 19:42:54,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:54,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677484400] [2022-02-20 19:42:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:54,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {36219#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36219#true} is VALID [2022-02-20 19:42:54,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {36219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {36219#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {36219#true} assume 0 == ~r1~0 % 256; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {36219#true} assume ~id1~0 >= 0; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {36219#true} assume 0 == ~st1~0; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {36219#true} assume ~send1~0 == ~id1~0; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {36219#true} assume 0 == ~mode1~0 % 256; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {36219#true} assume ~id2~0 >= 0; {36219#true} is VALID [2022-02-20 19:42:54,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {36219#true} assume 0 == ~st2~0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {36219#true} assume ~send2~0 == ~id2~0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {36219#true} assume 0 == ~mode2~0 % 256; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {36219#true} assume ~id3~0 >= 0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {36219#true} assume 0 == ~st3~0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {36219#true} assume ~send3~0 == ~id3~0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {36219#true} assume 0 == ~mode3~0 % 256; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {36219#true} assume ~id4~0 >= 0; {36219#true} is VALID [2022-02-20 19:42:54,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {36219#true} assume 0 == ~st4~0; {36219#true} is VALID [2022-02-20 19:42:54,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {36219#true} assume ~send4~0 == ~id4~0; {36219#true} is VALID [2022-02-20 19:42:54,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {36219#true} assume 0 == ~mode4~0 % 256; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {36221#(= (+ (* (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;main1_~i2~0#1 := 0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36221#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {36221#(= (+ (* (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; {36220#false} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {36220#false} assume node4_~m4~0#1 != ~nomsg~0; {36220#false} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {36220#false} assume !(node4_~m4~0#1 > ~id4~0); {36220#false} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {36220#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {36220#false} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {36220#false} ~mode4~0 := 0; {36220#false} is VALID [2022-02-20 19:42:54,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {36220#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36220#false} is VALID [2022-02-20 19:42:54,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {36220#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {36220#false} is VALID [2022-02-20 19:42:54,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {36220#false} check_#res#1 := check_~tmp~1#1; {36220#false} is VALID [2022-02-20 19:42:54,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {36220#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36220#false} is VALID [2022-02-20 19:42:54,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {36220#false} assume 0 == assert_~arg#1 % 256; {36220#false} is VALID [2022-02-20 19:42:54,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {36220#false} assume !false; {36220#false} is VALID [2022-02-20 19:42:54,076 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 19:42:54,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:54,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677484400] [2022-02-20 19:42:54,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677484400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:54,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:54,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:54,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667763409] [2022-02-20 19:42:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:54,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:54,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:54,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:54,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:54,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:54,109 INFO L87 Difference]: Start difference. First operand 1699 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:55,835 INFO L93 Difference]: Finished difference Result 2005 states and 3166 transitions. [2022-02-20 19:42:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:55,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:42:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:42:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:42:57,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:57,226 INFO L225 Difference]: With dead ends: 2005 [2022-02-20 19:42:57,226 INFO L226 Difference]: Without dead ends: 1840 [2022-02-20 19:42:57,227 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 19:42:57,227 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1639 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 19:42:57,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1639 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-02-20 19:42:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1838. [2022-02-20 19:42:57,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:57,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 19:42:57,397 INFO L74 IsIncluded]: Start isIncluded. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 19:42:57,398 INFO L87 Difference]: Start difference. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 19:42:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,492 INFO L93 Difference]: Finished difference Result 1840 states and 2909 transitions. [2022-02-20 19:42:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2909 transitions. [2022-02-20 19:42:57,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1840 states. [2022-02-20 19:42:57,497 INFO L87 Difference]: Start difference. First operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1840 states. [2022-02-20 19:42:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,588 INFO L93 Difference]: Finished difference Result 1840 states and 2909 transitions. [2022-02-20 19:42:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2909 transitions. [2022-02-20 19:42:57,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:57,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1836 states have (on average 1.5838779956427016) internal successors, (2908), 1837 states have internal predecessors, (2908), 0 states have call successors, (0), 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 19:42:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2908 transitions. [2022-02-20 19:42:57,688 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2908 transitions. Word has length 54 [2022-02-20 19:42:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:57,688 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2908 transitions. [2022-02-20 19:42:57,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2908 transitions. [2022-02-20 19:42:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:57,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:57,689 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] [2022-02-20 19:42:57,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:42:57,689 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1716204334, now seen corresponding path program 1 times [2022-02-20 19:42:57,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:57,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195400014] [2022-02-20 19:42:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:57,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {43904#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {43904#true} is VALID [2022-02-20 19:42:57,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {43904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {43904#true} is VALID [2022-02-20 19:42:57,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {43904#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {43904#true} is VALID [2022-02-20 19:42:57,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {43904#true} assume 0 == ~r1~0 % 256; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {43904#true} assume ~id1~0 >= 0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {43904#true} assume 0 == ~st1~0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {43904#true} assume ~send1~0 == ~id1~0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {43904#true} assume 0 == ~mode1~0 % 256; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {43904#true} assume ~id2~0 >= 0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {43904#true} assume 0 == ~st2~0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {43904#true} assume ~send2~0 == ~id2~0; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {43904#true} assume 0 == ~mode2~0 % 256; {43904#true} is VALID [2022-02-20 19:42:57,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {43904#true} assume ~id3~0 >= 0; {43904#true} is VALID [2022-02-20 19:42:57,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {43904#true} assume 0 == ~st3~0; {43904#true} is VALID [2022-02-20 19:42:57,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {43904#true} assume ~send3~0 == ~id3~0; {43904#true} is VALID [2022-02-20 19:42:57,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {43904#true} assume 0 == ~mode3~0 % 256; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {43906#(= (+ (* (- 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;main1_~i2~0#1 := 0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {43906#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {43906#(= (+ (* (- 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; {43905#false} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {43905#false} assume node3_~m3~0#1 != ~nomsg~0; {43905#false} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {43905#false} assume !(node3_~m3~0#1 > ~id3~0); {43905#false} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {43905#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {43905#false} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {43905#false} ~mode3~0 := 0; {43905#false} is VALID [2022-02-20 19:42:57,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {43905#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {43905#false} assume !(0 != ~mode4~0 % 256); {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {43905#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {43905#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {43905#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {43905#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {43905#false} check_#res#1 := check_~tmp~1#1; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {43905#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {43905#false} is VALID [2022-02-20 19:42:57,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {43905#false} assume 0 == assert_~arg#1 % 256; {43905#false} is VALID [2022-02-20 19:42:57,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {43905#false} assume !false; {43905#false} is VALID [2022-02-20 19:42:57,741 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 19:42:57,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:57,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195400014] [2022-02-20 19:42:57,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195400014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:57,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:57,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:57,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718514562] [2022-02-20 19:42:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:57,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:57,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:57,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:57,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:57,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:57,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:57,774 INFO L87 Difference]: Start difference. First operand 1838 states and 2908 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:59,750 INFO L93 Difference]: Finished difference Result 2398 states and 3750 transitions. [2022-02-20 19:42:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:59,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:42:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:42:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:42:59,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:01,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:01,182 INFO L225 Difference]: With dead ends: 2398 [2022-02-20 19:43:01,182 INFO L226 Difference]: Without dead ends: 2094 [2022-02-20 19:43:01,183 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 19:43:01,183 INFO L933 BasicCegarLoop]: 1570 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1648 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 19:43:01,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 1648 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-02-20 19:43:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2092. [2022-02-20 19:43:01,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:01,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 19:43:01,464 INFO L74 IsIncluded]: Start isIncluded. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 19:43:01,465 INFO L87 Difference]: Start difference. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 19:43:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,580 INFO L93 Difference]: Finished difference Result 2094 states and 3281 transitions. [2022-02-20 19:43:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3281 transitions. [2022-02-20 19:43:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 2094 states. [2022-02-20 19:43:01,586 INFO L87 Difference]: Start difference. First operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 2094 states. [2022-02-20 19:43:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,698 INFO L93 Difference]: Finished difference Result 2094 states and 3281 transitions. [2022-02-20 19:43:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3281 transitions. [2022-02-20 19:43:01,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:01,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2090 states have (on average 1.569377990430622) internal successors, (3280), 2091 states have internal predecessors, (3280), 0 states have call successors, (0), 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 19:43:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3280 transitions. [2022-02-20 19:43:01,846 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3280 transitions. Word has length 54 [2022-02-20 19:43:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:01,846 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 3280 transitions. [2022-02-20 19:43:01,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3280 transitions. [2022-02-20 19:43:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:01,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:01,847 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] [2022-02-20 19:43:01,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:01,847 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1442516622, now seen corresponding path program 1 times [2022-02-20 19:43:01,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:01,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701167848] [2022-02-20 19:43:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:01,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:01,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {52879#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {52879#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {52879#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {52879#true} assume 0 == ~r1~0 % 256; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {52879#true} assume ~id1~0 >= 0; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {52879#true} assume 0 == ~st1~0; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {52879#true} assume ~send1~0 == ~id1~0; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {52879#true} assume 0 == ~mode1~0 % 256; {52879#true} is VALID [2022-02-20 19:43:01,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {52879#true} assume ~id2~0 >= 0; {52879#true} is VALID [2022-02-20 19:43:01,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {52879#true} assume 0 == ~st2~0; {52879#true} is VALID [2022-02-20 19:43:01,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {52879#true} assume ~send2~0 == ~id2~0; {52879#true} is VALID [2022-02-20 19:43:01,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {52879#true} assume 0 == ~mode2~0 % 256; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {52881#(= (+ (* (- 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;main1_~i2~0#1 := 0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {52881#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:01,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {52881#(= (+ (* (- 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; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {52880#false} assume node2_~m2~0#1 != ~nomsg~0; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {52880#false} assume !(node2_~m2~0#1 > ~id2~0); {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {52880#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {52880#false} ~mode2~0 := 0; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {52880#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {52880#false} assume !(0 != ~mode3~0 % 256); {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {52880#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {52880#false} is VALID [2022-02-20 19:43:01,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {52880#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {52880#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {52880#false} assume !(0 != ~mode4~0 % 256); {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {52880#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {52880#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {52880#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {52880#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {52880#false} check_#res#1 := check_~tmp~1#1; {52880#false} is VALID [2022-02-20 19:43:01,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {52880#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {52880#false} is VALID [2022-02-20 19:43:01,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {52880#false} assume 0 == assert_~arg#1 % 256; {52880#false} is VALID [2022-02-20 19:43:01,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {52880#false} assume !false; {52880#false} is VALID [2022-02-20 19:43:01,900 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 19:43:01,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:01,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701167848] [2022-02-20 19:43:01,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701167848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:01,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:01,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:01,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854988383] [2022-02-20 19:43:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:01,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:01,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:01,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:01,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:01,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:01,931 INFO L87 Difference]: Start difference. First operand 2092 states and 3280 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:04,248 INFO L93 Difference]: Finished difference Result 3112 states and 4786 transitions. [2022-02-20 19:43:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:04,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:04,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:05,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:05,751 INFO L225 Difference]: With dead ends: 3112 [2022-02-20 19:43:05,751 INFO L226 Difference]: Without dead ends: 2554 [2022-02-20 19:43:05,751 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 19:43:05,752 INFO L933 BasicCegarLoop]: 1583 mSDtfsCounter, 1497 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1657 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 19:43:05,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-02-20 19:43:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2022-02-20 19:43:06,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:06,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 19:43:06,295 INFO L74 IsIncluded]: Start isIncluded. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 19:43:06,297 INFO L87 Difference]: Start difference. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 19:43:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,461 INFO L93 Difference]: Finished difference Result 2554 states and 3937 transitions. [2022-02-20 19:43:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3937 transitions. [2022-02-20 19:43:06,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:06,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:06,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 2554 states. [2022-02-20 19:43:06,467 INFO L87 Difference]: Start difference. First operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 2554 states. [2022-02-20 19:43:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,629 INFO L93 Difference]: Finished difference Result 2554 states and 3937 transitions. [2022-02-20 19:43:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3937 transitions. [2022-02-20 19:43:06,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:06,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:06,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:06,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5435294117647058) internal successors, (3936), 2551 states have internal predecessors, (3936), 0 states have call successors, (0), 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 19:43:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3936 transitions. [2022-02-20 19:43:06,819 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3936 transitions. Word has length 54 [2022-02-20 19:43:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:06,820 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3936 transitions. [2022-02-20 19:43:06,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 19:43:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3936 transitions. [2022-02-20 19:43:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:43:06,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:06,820 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] [2022-02-20 19:43:06,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:43:06,821 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1717241860, now seen corresponding path program 1 times [2022-02-20 19:43:06,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:06,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404225817] [2022-02-20 19:43:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:06,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {64218#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {64218#true} is VALID [2022-02-20 19:43:06,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {64218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {64218#true} is VALID [2022-02-20 19:43:06,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {64218#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64218#true} is VALID [2022-02-20 19:43:06,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {64218#true} assume 0 == ~r1~0 % 256; {64218#true} is VALID [2022-02-20 19:43:06,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {64218#true} assume ~id1~0 >= 0; {64218#true} is VALID [2022-02-20 19:43:06,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {64218#true} assume 0 == ~st1~0; {64218#true} is VALID [2022-02-20 19:43:06,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {64218#true} assume ~send1~0 == ~id1~0; {64218#true} is VALID [2022-02-20 19:43:06,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {64218#true} assume 0 == ~mode1~0 % 256; {64218#true} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {64218#true} assume ~id2~0 >= 0; {64218#true} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {64218#true} assume 0 == ~st2~0; {64218#true} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {64218#true} assume ~send2~0 == ~id2~0; {64218#true} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {64218#true} assume 0 == ~mode2~0 % 256; {64218#true} is VALID [2022-02-20 19:43:06,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {64218#true} assume ~id3~0 >= 0; {64218#true} is VALID [2022-02-20 19:43:06,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {64218#true} assume 0 == ~st3~0; {64218#true} is VALID [2022-02-20 19:43:06,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {64218#true} assume ~send3~0 == ~id3~0; {64218#true} is VALID [2022-02-20 19:43:06,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {64218#true} assume 0 == ~mode3~0 % 256; {64218#true} is VALID [2022-02-20 19:43:06,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {64218#true} assume ~id4~0 >= 0; {64218#true} is VALID [2022-02-20 19:43:06,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {64218#true} assume 0 == ~st4~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {64218#true} assume ~send4~0 == ~id4~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {64218#true} assume 0 == ~mode4~0 % 256; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {64218#true} assume ~id1~0 != ~id2~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {64218#true} assume ~id1~0 != ~id3~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {64218#true} assume ~id1~0 != ~id4~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {64218#true} assume ~id2~0 != ~id3~0; {64218#true} is VALID [2022-02-20 19:43:06,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {64218#true} assume ~id2~0 != ~id4~0; {64218#true} is VALID [2022-02-20 19:43:06,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {64218#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {64220#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:43:06,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {64220#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {64221#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:43:06,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {64221#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {64222#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {64222#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {64218#true} 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;main1_~i2~0#1 := 0; {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {64218#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {64218#true} assume !(0 != ~mode1~0 % 256); {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {64218#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {64218#true} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {64218#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {64218#true} assume !(0 != ~mode2~0 % 256); {64218#true} is VALID [2022-02-20 19:43:06,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {64218#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {64218#true} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {64218#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {64218#true} assume !(0 != ~mode3~0 % 256); {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {64218#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {64218#true} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {64218#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {64218#true} assume !(0 != ~mode4~0 % 256); {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {64218#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {64218#true} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {64218#true} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {64218#true} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {64218#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64218#true} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {64218#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {64218#true} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {64218#true} assume !(~r1~0 % 256 >= 4); {64218#true} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {64218#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {64218#true} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {64218#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {64223#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:43:06,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {64223#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {64224#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:43:06,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {64224#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64225#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:43:06,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {64225#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {64219#false} is VALID [2022-02-20 19:43:06,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {64219#false} assume !false; {64219#false} is VALID [2022-02-20 19:43:06,916 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 19:43:06,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:06,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404225817] [2022-02-20 19:43:06,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404225817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:06,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:06,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:43:06,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521726125] [2022-02-20 19:43:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:43:06,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:06,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 19:43:06,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:06,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:43:06,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:06,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:43:06,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:06,955 INFO L87 Difference]: Start difference. First operand 2552 states and 3936 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 19:43:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:14,656 INFO L93 Difference]: Finished difference Result 3322 states and 5037 transitions. [2022-02-20 19:43:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:43:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:43:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 19:43:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 19:43:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:14,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1616 transitions. [2022-02-20 19:43:15,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1616 edges. 1616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:16,110 INFO L225 Difference]: With dead ends: 3322 [2022-02-20 19:43:16,110 INFO L226 Difference]: Without dead ends: 3320 [2022-02-20 19:43:16,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:43:16,111 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 498 mSDsluCounter, 9002 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 10579 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:16,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 10579 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states.