./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.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 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:21,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:21,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:21,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:21,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:21,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:21,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:21,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:21,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:21,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:21,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:21,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:21,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:21,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:21,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:21,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:21,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:21,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:21,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:21,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:21,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:21,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:21,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:21,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:21,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:21,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:21,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:21,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:21,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:21,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:21,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:21,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:21,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:21,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:21,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:21,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:21,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:21,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:21,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:21,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:21,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:21,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:51:21,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:21,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:21,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:21,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:21,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:21,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:21,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:21,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:21,754 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:21,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:21,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:21,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:21,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:21,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:21,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:21,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:21,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:21,758 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 -> 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 [2022-02-20 18:51:21,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:21,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:21,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:21,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:21,977 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:21,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:22,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b7a19df/0508b1d02af24c13b30cfd178e3082fb/FLAG443bba35a [2022-02-20 18:51:22,335 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:22,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:22,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b7a19df/0508b1d02af24c13b30cfd178e3082fb/FLAG443bba35a [2022-02-20 18:51:22,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b7a19df/0508b1d02af24c13b30cfd178e3082fb [2022-02-20 18:51:22,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:22,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:22,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:22,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:22,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:22,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:22" (1/1) ... [2022-02-20 18:51:22,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee57cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:22, skipping insertion in model container [2022-02-20 18:51:22,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:22" (1/1) ... [2022-02-20 18:51:22,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:22,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:22,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2022-02-20 18:51:23,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:23,028 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:23,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2022-02-20 18:51:23,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:23,091 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:23,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23 WrapperNode [2022-02-20 18:51:23,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:23,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:23,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:23,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:23,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,157 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 343 [2022-02-20 18:51:23,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:23,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:23,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:23,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:23,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:23,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:23,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:23,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:23,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (1/1) ... [2022-02-20 18:51:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:23,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:51:23,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:51:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:23,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:23,322 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:23,323 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:23,748 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:23,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:23,753 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:23,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:23 BoogieIcfgContainer [2022-02-20 18:51:23,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:23,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:23,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:23,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:22" (1/3) ... [2022-02-20 18:51:23,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716227c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:23, skipping insertion in model container [2022-02-20 18:51:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:23" (2/3) ... [2022-02-20 18:51:23,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716227c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:23, skipping insertion in model container [2022-02-20 18:51:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:23" (3/3) ... [2022-02-20 18:51:23,762 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:23,765 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:23,766 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:51:23,794 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:23,798 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:51:23,798 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:51:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:51:23,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:23,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] [2022-02-20 18:51:23,814 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -347547403, now seen corresponding path program 1 times [2022-02-20 18:51:23,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:23,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209760615] [2022-02-20 18:51:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:24,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {82#true} is VALID [2022-02-20 18:51:24,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {82#true} is VALID [2022-02-20 18:51:24,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 == ~r1~0; {82#true} is VALID [2022-02-20 18:51:24,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} assume ~id1~0 >= 0; {82#true} is VALID [2022-02-20 18:51:24,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} assume 0 == ~st1~0; {82#true} is VALID [2022-02-20 18:51:24,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} assume ~send1~0 == ~id1~0; {82#true} is VALID [2022-02-20 18:51:24,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#true} assume 0 == ~mode1~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:24,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {83#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:24,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {83#false} ~mode1~0 := 0; {83#false} is VALID [2022-02-20 18:51:24,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {83#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {83#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {83#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:24,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {83#false} ~mode2~0 := 0; {83#false} is VALID [2022-02-20 18:51:24,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {83#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {83#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {83#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:24,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {83#false} ~mode3~0 := 0; {83#false} is VALID [2022-02-20 18:51:24,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {83#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {83#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:24,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {83#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:24,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {83#false} ~mode4~0 := 0; {83#false} is VALID [2022-02-20 18:51:24,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {83#false} ~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;havoc main_~check__tmp~0#1; {83#false} is VALID [2022-02-20 18:51:24,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {83#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {83#false} is VALID [2022-02-20 18:51:24,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {83#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {83#false} is VALID [2022-02-20 18:51:24,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {83#false} assume 0 == main_~assert__arg~0#1 % 256; {83#false} is VALID [2022-02-20 18:51:24,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 18:51:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:24,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:24,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209760615] [2022-02-20 18:51:24,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209760615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:24,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:24,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:24,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307331981] [2022-02-20 18:51:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:24,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:24,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:24,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:24,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:24,228 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:24,505 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2022-02-20 18:51:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-20 18:51:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-20 18:51:24,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 286 transitions. [2022-02-20 18:51:24,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:24,730 INFO L225 Difference]: With dead ends: 177 [2022-02-20 18:51:24,730 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 18:51:24,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:24,735 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 91 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:24,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 18:51:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-02-20 18:51:24,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:24,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,760 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,760 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:24,764 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-02-20 18:51:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-02-20 18:51:24,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:24,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:24,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:51:24,766 INFO L87 Difference]: Start difference. First operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:51:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:24,769 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-02-20 18:51:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-02-20 18:51:24,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:24,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:24,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:24,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2022-02-20 18:51:24,774 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 47 [2022-02-20 18:51:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:24,775 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2022-02-20 18:51:24,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2022-02-20 18:51:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:51:24,776 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:24,776 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] [2022-02-20 18:51:24,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:24,777 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -391185874, now seen corresponding path program 1 times [2022-02-20 18:51:24,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:24,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656657470] [2022-02-20 18:51:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:24,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {708#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {708#true} is VALID [2022-02-20 18:51:24,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {708#true} is VALID [2022-02-20 18:51:24,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {708#true} assume 0 == ~r1~0; {708#true} is VALID [2022-02-20 18:51:24,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {708#true} assume ~id1~0 >= 0; {708#true} is VALID [2022-02-20 18:51:24,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {708#true} assume 0 == ~st1~0; {708#true} is VALID [2022-02-20 18:51:24,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {708#true} assume ~send1~0 == ~id1~0; {708#true} is VALID [2022-02-20 18:51:24,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {708#true} assume 0 == ~mode1~0 % 256; {708#true} is VALID [2022-02-20 18:51:24,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {708#true} assume ~id2~0 >= 0; {708#true} is VALID [2022-02-20 18:51:24,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {708#true} assume 0 == ~st2~0; {708#true} is VALID [2022-02-20 18:51:24,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#true} assume ~send2~0 == ~id2~0; {708#true} is VALID [2022-02-20 18:51:24,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {708#true} assume 0 == ~mode2~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:24,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:24,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {709#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:24,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {709#false} ~mode2~0 := 0; {709#false} is VALID [2022-02-20 18:51:24,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {709#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:24,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {709#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:24,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {709#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:24,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#false} ~mode3~0 := 0; {709#false} is VALID [2022-02-20 18:51:24,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {709#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:24,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {709#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {709#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {709#false} ~mode4~0 := 0; {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {709#false} ~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;havoc main_~check__tmp~0#1; {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {709#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {709#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {709#false} is VALID [2022-02-20 18:51:24,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {709#false} assume 0 == main_~assert__arg~0#1 % 256; {709#false} is VALID [2022-02-20 18:51:24,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {709#false} assume !false; {709#false} is VALID [2022-02-20 18:51:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:24,856 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:24,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656657470] [2022-02-20 18:51:24,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656657470] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:24,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:24,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:24,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674560595] [2022-02-20 18:51:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:51:24,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:24,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:24,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:24,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:24,892 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,042 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2022-02-20 18:51:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:51:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:25,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:25,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,235 INFO L225 Difference]: With dead ends: 280 [2022-02-20 18:51:25,235 INFO L226 Difference]: Without dead ends: 190 [2022-02-20 18:51:25,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:25,236 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:25,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-20 18:51:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-02-20 18:51:25,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:25,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,248 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,248 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,252 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-02-20 18:51:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2022-02-20 18:51:25,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 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 190 states. [2022-02-20 18:51:25,254 INFO L87 Difference]: Start difference. First operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 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 190 states. [2022-02-20 18:51:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,259 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-02-20 18:51:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2022-02-20 18:51:25,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:25,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2022-02-20 18:51:25,265 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 48 [2022-02-20 18:51:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:25,266 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2022-02-20 18:51:25,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2022-02-20 18:51:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:51:25,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:25,267 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] [2022-02-20 18:51:25,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:25,268 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2047730124, now seen corresponding path program 1 times [2022-02-20 18:51:25,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:25,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110604271] [2022-02-20 18:51:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:25,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {1724#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {1724#true} is VALID [2022-02-20 18:51:25,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {1724#true} is VALID [2022-02-20 18:51:25,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1724#true} assume 0 == ~r1~0; {1724#true} is VALID [2022-02-20 18:51:25,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {1724#true} assume ~id1~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:25,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1724#true} assume 0 == ~st1~0; {1724#true} is VALID [2022-02-20 18:51:25,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1724#true} assume ~send1~0 == ~id1~0; {1724#true} is VALID [2022-02-20 18:51:25,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {1724#true} assume 0 == ~mode1~0 % 256; {1724#true} is VALID [2022-02-20 18:51:25,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1724#true} assume ~id2~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:25,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {1724#true} assume 0 == ~st2~0; {1724#true} is VALID [2022-02-20 18:51:25,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1724#true} assume ~send2~0 == ~id2~0; {1724#true} is VALID [2022-02-20 18:51:25,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {1724#true} assume 0 == ~mode2~0 % 256; {1724#true} is VALID [2022-02-20 18:51:25,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {1724#true} assume ~id3~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:25,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#true} assume 0 == ~st3~0; {1724#true} is VALID [2022-02-20 18:51:25,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {1724#true} assume ~send3~0 == ~id3~0; {1724#true} is VALID [2022-02-20 18:51:25,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {1724#true} assume 0 == ~mode3~0 % 256; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:25,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {1725#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {1725#false} ~mode3~0 := 0; {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {1725#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {1725#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {1725#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1725#false} is VALID [2022-02-20 18:51:25,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {1725#false} ~mode4~0 := 0; {1725#false} is VALID [2022-02-20 18:51:25,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {1725#false} ~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;havoc main_~check__tmp~0#1; {1725#false} is VALID [2022-02-20 18:51:25,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {1725#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {1725#false} is VALID [2022-02-20 18:51:25,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {1725#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1725#false} is VALID [2022-02-20 18:51:25,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {1725#false} assume 0 == main_~assert__arg~0#1 % 256; {1725#false} is VALID [2022-02-20 18:51:25,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {1725#false} assume !false; {1725#false} is VALID [2022-02-20 18:51:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:25,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:25,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110604271] [2022-02-20 18:51:25,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110604271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:25,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:25,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:25,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025385332] [2022-02-20 18:51:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:51:25,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:25,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:25,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:25,392 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,550 INFO L93 Difference]: Finished difference Result 480 states and 745 transitions. [2022-02-20 18:51:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:25,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:51:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:25,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:25,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,724 INFO L225 Difference]: With dead ends: 480 [2022-02-20 18:51:25,724 INFO L226 Difference]: Without dead ends: 318 [2022-02-20 18:51:25,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:25,726 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:25,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-02-20 18:51:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2022-02-20 18:51:25,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:25,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,742 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,743 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,750 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2022-02-20 18:51:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 484 transitions. [2022-02-20 18:51:25,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 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 318 states. [2022-02-20 18:51:25,752 INFO L87 Difference]: Start difference. First operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 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 318 states. [2022-02-20 18:51:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,759 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2022-02-20 18:51:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 484 transitions. [2022-02-20 18:51:25,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:25,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 483 transitions. [2022-02-20 18:51:25,768 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 483 transitions. Word has length 49 [2022-02-20 18:51:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:25,768 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 483 transitions. [2022-02-20 18:51:25,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 483 transitions. [2022-02-20 18:51:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:25,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:25,769 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] [2022-02-20 18:51:25,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:25,770 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -415311335, now seen corresponding path program 1 times [2022-02-20 18:51:25,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:25,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425970855] [2022-02-20 18:51:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:25,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {3457#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} assume 0 == ~r1~0; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {3457#true} assume ~id1~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {3457#true} assume 0 == ~st1~0; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#true} assume ~send1~0 == ~id1~0; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {3457#true} assume 0 == ~mode1~0 % 256; {3457#true} is VALID [2022-02-20 18:51:25,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} assume ~id2~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} assume 0 == ~st2~0; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} assume ~send2~0 == ~id2~0; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {3457#true} assume 0 == ~mode2~0 % 256; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#true} assume ~id3~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} assume 0 == ~st3~0; {3457#true} is VALID [2022-02-20 18:51:25,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#true} assume ~send3~0 == ~id3~0; {3457#true} is VALID [2022-02-20 18:51:25,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {3457#true} assume 0 == ~mode3~0 % 256; {3457#true} is VALID [2022-02-20 18:51:25,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {3457#true} assume ~id4~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:25,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {3457#true} assume 0 == ~st4~0; {3457#true} is VALID [2022-02-20 18:51:25,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {3457#true} assume ~send4~0 == ~id4~0; {3457#true} is VALID [2022-02-20 18:51:25,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {3457#true} assume 0 == ~mode4~0 % 256; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:25,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {3458#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {3458#false} ~mode4~0 := 0; {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {3458#false} ~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;havoc main_~check__tmp~0#1; {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {3458#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {3458#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3458#false} is VALID [2022-02-20 18:51:25,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {3458#false} assume 0 == main_~assert__arg~0#1 % 256; {3458#false} is VALID [2022-02-20 18:51:25,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2022-02-20 18:51:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:25,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:25,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425970855] [2022-02-20 18:51:25,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425970855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:25,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:25,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:25,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887331336] [2022-02-20 18:51:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:51:25,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:25,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:25,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:25,879 INFO L87 Difference]: Start difference. First operand 316 states and 483 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,059 INFO L93 Difference]: Finished difference Result 832 states and 1293 transitions. [2022-02-20 18:51:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:51:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:26,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:26,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,227 INFO L225 Difference]: With dead ends: 832 [2022-02-20 18:51:26,227 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 18:51:26,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:26,228 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:26,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 18:51:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2022-02-20 18:51:26,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:26,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,252 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,253 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,265 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2022-02-20 18:51:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2022-02-20 18:51:26,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 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 542 states. [2022-02-20 18:51:26,267 INFO L87 Difference]: Start difference. First operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 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 542 states. [2022-02-20 18:51:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,279 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2022-02-20 18:51:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2022-02-20 18:51:26,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:26,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 827 transitions. [2022-02-20 18:51:26,295 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 827 transitions. Word has length 50 [2022-02-20 18:51:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:26,295 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 827 transitions. [2022-02-20 18:51:26,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 827 transitions. [2022-02-20 18:51:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:26,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:26,300 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] [2022-02-20 18:51:26,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:26,300 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -103942672, now seen corresponding path program 1 times [2022-02-20 18:51:26,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:26,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499878055] [2022-02-20 18:51:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:26,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {6450#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {6450#true} is VALID [2022-02-20 18:51:26,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {6450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {6450#true} is VALID [2022-02-20 18:51:26,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {6450#true} assume 0 == ~r1~0; {6450#true} is VALID [2022-02-20 18:51:26,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {6450#true} assume ~id1~0 >= 0; {6450#true} is VALID [2022-02-20 18:51:26,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {6450#true} assume 0 == ~st1~0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:26,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {6452#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:26,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {6452#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:26,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {6452#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:26,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {6452#(<= ~st1~0 0)} assume 0 == ~st2~0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:26,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {6451#false} is VALID [2022-02-20 18:51:26,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {6451#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6451#false} is VALID [2022-02-20 18:51:26,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {6451#false} assume 0 == main_~assert__arg~0#1 % 256; {6451#false} is VALID [2022-02-20 18:51:26,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {6451#false} assume !false; {6451#false} is VALID [2022-02-20 18:51:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:26,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:26,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499878055] [2022-02-20 18:51:26,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499878055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:26,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:26,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:26,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825567925] [2022-02-20 18:51:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:26,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:51:26,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:26,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:26,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:26,430 INFO L87 Difference]: Start difference. First operand 540 states and 827 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,525 INFO L93 Difference]: Finished difference Result 4652 states and 7235 transitions. [2022-02-20 18:51:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:51:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:51:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2022-02-20 18:51:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2022-02-20 18:51:29,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 737 transitions. [2022-02-20 18:51:30,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 737 edges. 737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:30,678 INFO L225 Difference]: With dead ends: 4652 [2022-02-20 18:51:30,678 INFO L226 Difference]: Without dead ends: 4138 [2022-02-20 18:51:30,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:30,680 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 784 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:30,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 993 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2022-02-20 18:51:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 1052. [2022-02-20 18:51:31,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:31,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,349 INFO L74 IsIncluded]: Start isIncluded. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,350 INFO L87 Difference]: Start difference. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:31,855 INFO L93 Difference]: Finished difference Result 4138 states and 6306 transitions. [2022-02-20 18:51:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6306 transitions. [2022-02-20 18:51:31,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:31,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:31,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 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 4138 states. [2022-02-20 18:51:31,863 INFO L87 Difference]: Start difference. First operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 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 4138 states. [2022-02-20 18:51:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:32,374 INFO L93 Difference]: Finished difference Result 4138 states and 6306 transitions. [2022-02-20 18:51:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6306 transitions. [2022-02-20 18:51:32,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:32,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:32,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:32,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1595 transitions. [2022-02-20 18:51:32,437 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1595 transitions. Word has length 51 [2022-02-20 18:51:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:32,437 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1595 transitions. [2022-02-20 18:51:32,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1595 transitions. [2022-02-20 18:51:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:32,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:32,438 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] [2022-02-20 18:51:32,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:32,439 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2026482100, now seen corresponding path program 1 times [2022-02-20 18:51:32,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:32,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083124079] [2022-02-20 18:51:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:32,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {22737#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {22737#true} is VALID [2022-02-20 18:51:32,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {22737#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {22737#true} is VALID [2022-02-20 18:51:32,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {22737#true} assume 0 == ~r1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {22739#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {22739#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {22739#(<= ~r1~0 0)} assume ~id3~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {22739#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {22739#(<= ~r1~0 0)} assume ~id4~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {22739#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {22739#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {22739#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {22739#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send1~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {22739#(<= ~r1~0 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {22739#(<= ~r1~0 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send2~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {22739#(<= ~r1~0 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {22739#(<= ~r1~0 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send3~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {22739#(<= ~r1~0 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {22739#(<= ~r1~0 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {22739#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {22739#(<= ~r1~0 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {22739#(<= ~r1~0 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {22739#(<= ~r1~0 0)} ~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;havoc main_~check__tmp~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {22739#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:51:32,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {22739#(<= ~r1~0 0)} assume ~r1~0 >= 4; {22738#false} is VALID [2022-02-20 18:51:32,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {22738#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {22738#false} is VALID [2022-02-20 18:51:32,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {22738#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {22738#false} is VALID [2022-02-20 18:51:32,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {22738#false} assume 0 == main_~assert__arg~0#1 % 256; {22738#false} is VALID [2022-02-20 18:51:32,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {22738#false} assume !false; {22738#false} is VALID [2022-02-20 18:51:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:32,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:32,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083124079] [2022-02-20 18:51:32,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083124079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:32,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:32,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:32,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201693203] [2022-02-20 18:51:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:51:32,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:32,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:32,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:32,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:32,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:32,555 INFO L87 Difference]: Start difference. First operand 1052 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:33,833 INFO L93 Difference]: Finished difference Result 2570 states and 3911 transitions. [2022-02-20 18:51:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:51:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2022-02-20 18:51:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2022-02-20 18:51:33,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 254 transitions. [2022-02-20 18:51:33,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:34,061 INFO L225 Difference]: With dead ends: 2570 [2022-02-20 18:51:34,061 INFO L226 Difference]: Without dead ends: 1544 [2022-02-20 18:51:34,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:34,064 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:34,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-02-20 18:51:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2022-02-20 18:51:35,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:35,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,244 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,246 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,317 INFO L93 Difference]: Finished difference Result 1544 states and 2318 transitions. [2022-02-20 18:51:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2318 transitions. [2022-02-20 18:51:35,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:35,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:35,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 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 1544 states. [2022-02-20 18:51:35,324 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 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 1544 states. [2022-02-20 18:51:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,395 INFO L93 Difference]: Finished difference Result 1544 states and 2318 transitions. [2022-02-20 18:51:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2318 transitions. [2022-02-20 18:51:35,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:35,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:35,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:35,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2317 transitions. [2022-02-20 18:51:35,497 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2317 transitions. Word has length 53 [2022-02-20 18:51:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:35,498 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2317 transitions. [2022-02-20 18:51:35,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2317 transitions. [2022-02-20 18:51:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:35,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:35,499 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] [2022-02-20 18:51:35,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:35,499 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2005479445, now seen corresponding path program 1 times [2022-02-20 18:51:35,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:35,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375037590] [2022-02-20 18:51:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:35,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {31608#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {31608#true} is VALID [2022-02-20 18:51:35,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {31608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {31608#true} is VALID [2022-02-20 18:51:35,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {31608#true} assume 0 == ~r1~0; {31608#true} is VALID [2022-02-20 18:51:35,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {31608#true} assume ~id1~0 >= 0; {31608#true} is VALID [2022-02-20 18:51:35,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {31608#true} assume 0 == ~st1~0; {31610#(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 18:51:35,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {31610#(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; {31610#(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 18:51:35,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {31610#(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; {31610#(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 18:51:35,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {31610#(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; {31610#(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 18:51:35,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {31610#(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; {31611#(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 18:51:35,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {31611#(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; {31611#(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 18:51:35,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {31611#(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; {31611#(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 18:51:35,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {31611#(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; {31611#(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 18:51:35,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {31611#(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; {31612#(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 18:51:35,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {31612#(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; {31612#(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 18:51:35,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {31612#(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; {31612#(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 18:51:35,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {31612#(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; {31612#(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 18:51:35,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {31612#(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; {31613#(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 18:51:35,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {31613#(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; {31613#(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 18:51:35,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {31613#(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; {31613#(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 18:51:35,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {31613#(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; {31613#(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 18:51:35,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {31613#(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; {31613#(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 18:51:35,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {31613#(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; {31613#(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 18:51:35,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {31613#(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; {31613#(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 18:51:35,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {31613#(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; {31613#(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 18:51:35,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {31613#(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;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {31613#(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 18:51:35,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {31613#(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 18:51:35,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31613#(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 18:51:35,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {31613#(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);havoc main_~node1____CPAchecker_TMP_0~0#1; {31613#(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 18:51:35,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {31613#(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); {31613#(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 18:51:35,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {31613#(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 18:51:35,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {31613#(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 18:51:35,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {31613#(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 18:51:35,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {31613#(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);havoc main_~node2____CPAchecker_TMP_0~0#1; {31613#(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 18:51:35,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {31613#(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); {31613#(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 18:51:35,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {31613#(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 18:51:35,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {31613#(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 18:51:35,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {31613#(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 18:51:35,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {31613#(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);havoc main_~node3____CPAchecker_TMP_0~0#1; {31613#(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 18:51:35,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {31613#(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); {31613#(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 18:51:35,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {31613#(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 18:51:35,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {31613#(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 18:51:35,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {31613#(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 18:51:35,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {31613#(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);havoc main_~node4____CPAchecker_TMP_0~0#1; {31613#(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 18:51:35,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {31613#(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; {31613#(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 18:51:35,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {31613#(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 18:51:35,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {31613#(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 18:51:35,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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;havoc main_~check__tmp~0#1; {31613#(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 18:51:35,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {31613#(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; {31613#(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 18:51:35,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {31613#(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 18:51:35,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {31613#(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);main_~check__tmp~0#1 := 0; {31609#false} is VALID [2022-02-20 18:51:35,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {31609#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {31609#false} is VALID [2022-02-20 18:51:35,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {31609#false} assume 0 == main_~assert__arg~0#1 % 256; {31609#false} is VALID [2022-02-20 18:51:35,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {31609#false} assume !false; {31609#false} is VALID [2022-02-20 18:51:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:35,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:35,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375037590] [2022-02-20 18:51:35,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375037590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:35,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:35,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:35,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915589389] [2022-02-20 18:51:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:35,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:51:35,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:35,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:35,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:35,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:35,735 INFO L87 Difference]: Start difference. First operand 1542 states and 2317 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:37,568 INFO L93 Difference]: Finished difference Result 3058 states and 4607 transitions. [2022-02-20 18:51:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:51:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:51:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:51:37,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 261 transitions. [2022-02-20 18:51:37,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:37,817 INFO L225 Difference]: With dead ends: 3058 [2022-02-20 18:51:37,818 INFO L226 Difference]: Without dead ends: 1544 [2022-02-20 18:51:37,819 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 18:51:37,819 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 209 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:37,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 330 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-02-20 18:51:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2022-02-20 18:51:38,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:38,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,942 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,944 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,013 INFO L93 Difference]: Finished difference Result 1544 states and 2294 transitions. [2022-02-20 18:51:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2294 transitions. [2022-02-20 18:51:39,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 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 1544 states. [2022-02-20 18:51:39,019 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 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 1544 states. [2022-02-20 18:51:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,089 INFO L93 Difference]: Finished difference Result 1544 states and 2294 transitions. [2022-02-20 18:51:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2294 transitions. [2022-02-20 18:51:39,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:39,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2293 transitions. [2022-02-20 18:51:39,199 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2293 transitions. Word has length 53 [2022-02-20 18:51:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:39,199 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2293 transitions. [2022-02-20 18:51:39,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2293 transitions. [2022-02-20 18:51:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:39,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:39,201 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 18:51:39,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:39,201 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2042230043, now seen corresponding path program 1 times [2022-02-20 18:51:39,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:39,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824025242] [2022-02-20 18:51:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:39,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {41182#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:39,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:39,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:39,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {41185#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:39,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {41185#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {41185#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:39,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {41185#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:39,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {41183#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {41183#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {41183#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {41183#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {41183#false} assume !(~send2~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {41183#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {41183#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {41183#false} is VALID [2022-02-20 18:51:39,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {41183#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {41183#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {41183#false} assume !(~send3~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {41183#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {41183#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {41183#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {41183#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {41183#false} assume ~send4~0 != ~nomsg~0; {41183#false} is VALID [2022-02-20 18:51:39,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {41183#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {41183#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {41183#false} ~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;havoc main_~check__tmp~0#1; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {41183#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {41183#false} assume !(~r1~0 >= 4); {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {41183#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {41183#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {41183#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {41183#false} is VALID [2022-02-20 18:51:39,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {41183#false} assume 0 == main_~assert__arg~0#1 % 256; {41183#false} is VALID [2022-02-20 18:51:39,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {41183#false} assume !false; {41183#false} is VALID [2022-02-20 18:51:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:39,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:39,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824025242] [2022-02-20 18:51:39,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824025242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:39,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:39,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:39,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124498602] [2022-02-20 18:51:39,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:39,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:39,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:39,300 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 18:51:39,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:39,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:39,301 INFO L87 Difference]: Start difference. First operand 1542 states and 2293 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,002 INFO L93 Difference]: Finished difference Result 4082 states and 6111 transitions. [2022-02-20 18:51:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2022-02-20 18:51:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2022-02-20 18:51:43,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 263 transitions. [2022-02-20 18:51:43,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:43,402 INFO L225 Difference]: With dead ends: 4082 [2022-02-20 18:51:43,402 INFO L226 Difference]: Without dead ends: 2568 [2022-02-20 18:51:43,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:43,405 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 428 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:43,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-02-20 18:51:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2566. [2022-02-20 18:51:46,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:46,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2568 states. Second operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,274 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,277 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,461 INFO L93 Difference]: Finished difference Result 2568 states and 3814 transitions. [2022-02-20 18:51:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3814 transitions. [2022-02-20 18:51:46,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 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 2568 states. [2022-02-20 18:51:46,468 INFO L87 Difference]: Start difference. First operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 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 2568 states. [2022-02-20 18:51:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,656 INFO L93 Difference]: Finished difference Result 2568 states and 3814 transitions. [2022-02-20 18:51:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3814 transitions. [2022-02-20 18:51:46,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:46,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3813 transitions. [2022-02-20 18:51:46,958 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3813 transitions. Word has length 54 [2022-02-20 18:51:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:46,958 INFO L470 AbstractCegarLoop]: Abstraction has 2566 states and 3813 transitions. [2022-02-20 18:51:46,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3813 transitions. [2022-02-20 18:51:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:46,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:46,959 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 18:51:46,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:46,960 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1489873546, now seen corresponding path program 1 times [2022-02-20 18:51:46,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:46,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842562451] [2022-02-20 18:51:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:47,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {55683#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {55685#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {55685#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {55686#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:47,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {55686#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {55686#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:47,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {55686#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {55687#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:47,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {55687#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {55684#false} is VALID [2022-02-20 18:51:47,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {55684#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {55684#false} is VALID [2022-02-20 18:51:47,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {55684#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {55684#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {55684#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {55684#false} assume !(~send3~0 != ~nomsg~0); {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {55684#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {55684#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {55684#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {55684#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {55684#false} is VALID [2022-02-20 18:51:47,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {55684#false} assume ~send4~0 != ~nomsg~0; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {55684#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {55684#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {55684#false} ~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;havoc main_~check__tmp~0#1; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {55684#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {55684#false} assume !(~r1~0 >= 4); {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {55684#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {55684#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {55684#false} is VALID [2022-02-20 18:51:47,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {55684#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {55684#false} is VALID [2022-02-20 18:51:47,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {55684#false} assume 0 == main_~assert__arg~0#1 % 256; {55684#false} is VALID [2022-02-20 18:51:47,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {55684#false} assume !false; {55684#false} is VALID [2022-02-20 18:51:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:47,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:47,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842562451] [2022-02-20 18:51:47,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842562451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:47,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:47,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:47,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192026492] [2022-02-20 18:51:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:47,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:47,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:47,050 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 18:51:47,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:47,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:47,051 INFO L87 Difference]: Start difference. First operand 2566 states and 3813 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,966 INFO L93 Difference]: Finished difference Result 5104 states and 7598 transitions. [2022-02-20 18:51:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2022-02-20 18:51:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2022-02-20 18:51:51,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 184 transitions. [2022-02-20 18:51:52,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:52,329 INFO L225 Difference]: With dead ends: 5104 [2022-02-20 18:51:52,329 INFO L226 Difference]: Without dead ends: 2566 [2022-02-20 18:51:52,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:52,332 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 260 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:52,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-02-20 18:51:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2022-02-20 18:51:56,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:56,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,010 INFO L74 IsIncluded]: Start isIncluded. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,011 INFO L87 Difference]: Start difference. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,187 INFO L93 Difference]: Finished difference Result 2566 states and 3773 transitions. [2022-02-20 18:51:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3773 transitions. [2022-02-20 18:51:56,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 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 2566 states. [2022-02-20 18:51:56,197 INFO L87 Difference]: Start difference. First operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 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 2566 states. [2022-02-20 18:51:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,390 INFO L93 Difference]: Finished difference Result 2566 states and 3773 transitions. [2022-02-20 18:51:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3773 transitions. [2022-02-20 18:51:56,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:56,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3773 transitions. [2022-02-20 18:51:56,670 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3773 transitions. Word has length 54 [2022-02-20 18:51:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:56,670 INFO L470 AbstractCegarLoop]: Abstraction has 2566 states and 3773 transitions. [2022-02-20 18:51:56,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3773 transitions. [2022-02-20 18:51:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:56,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:56,671 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 18:51:56,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:56,671 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1617958853, now seen corresponding path program 1 times [2022-02-20 18:51:56,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:56,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126038137] [2022-02-20 18:51:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:56,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {71618#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {71620#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:56,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {71620#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {71621#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:56,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {71621#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {71621#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:56,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {71621#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {71622#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {71622#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0); {71619#false} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {71619#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {71619#false} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {71619#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {71619#false} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {71619#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {71619#false} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {71619#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {71619#false} assume ~send4~0 != ~nomsg~0; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {71619#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {71619#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {71619#false} ~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;havoc main_~check__tmp~0#1; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {71619#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {71619#false} assume !(~r1~0 >= 4); {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {71619#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {71619#false} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {71619#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {71619#false} is VALID [2022-02-20 18:51:56,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {71619#false} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {71619#false} is VALID [2022-02-20 18:51:56,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {71619#false} assume 0 == main_~assert__arg~0#1 % 256; {71619#false} is VALID [2022-02-20 18:51:56,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {71619#false} assume !false; {71619#false} is VALID [2022-02-20 18:51:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:56,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:56,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126038137] [2022-02-20 18:51:56,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126038137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:56,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:56,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:56,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014293315] [2022-02-20 18:51:56,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:56,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:56,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:51:56,754 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 18:51:56,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:56,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:56,755 INFO L87 Difference]: Start difference. First operand 2566 states and 3773 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:52:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:02,426 INFO L93 Difference]: Finished difference Result 5104 states and 7518 transitions. [2022-02-20 18:52:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:52:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:52:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 18:52:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:52:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 18:52:02,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 18:52:02,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:02,805 INFO L225 Difference]: With dead ends: 5104 [2022-02-20 18:52:02,805 INFO L226 Difference]: Without dead ends: 2566 [2022-02-20 18:52:02,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:02,807 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 244 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:02,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-02-20 18:52:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2022-02-20 18:52:07,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,277 INFO L74 IsIncluded]: Start isIncluded. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,278 INFO L87 Difference]: Start difference. First operand 2566 states. Second operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,458 INFO L93 Difference]: Finished difference Result 2566 states and 3733 transitions. [2022-02-20 18:52:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3733 transitions. [2022-02-20 18:52:07,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 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 2566 states. [2022-02-20 18:52:07,464 INFO L87 Difference]: Start difference. First operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 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 2566 states. [2022-02-20 18:52:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,645 INFO L93 Difference]: Finished difference Result 2566 states and 3733 transitions. [2022-02-20 18:52:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3733 transitions. [2022-02-20 18:52:07,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3733 transitions. [2022-02-20 18:52:07,928 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3733 transitions. Word has length 54 [2022-02-20 18:52:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,928 INFO L470 AbstractCegarLoop]: Abstraction has 2566 states and 3733 transitions. [2022-02-20 18:52:07,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 18:52:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3733 transitions. [2022-02-20 18:52:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:07,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,929 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 18:52:07,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:07,929 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1811476054, now seen corresponding path program 1 times [2022-02-20 18:52:07,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243152710] [2022-02-20 18:52:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {87553#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_3032~0 := 0;~__return_3101~0 := 0; {87553#true} is VALID [2022-02-20 18:52:07,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {87553#true} is VALID [2022-02-20 18:52:07,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume 0 == ~r1~0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {87553#true} assume ~id1~0 >= 0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {87553#true} assume 0 == ~st1~0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} assume ~send1~0 == ~id1~0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {87553#true} assume 0 == ~mode1~0 % 256; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {87553#true} assume ~id2~0 >= 0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {87553#true} assume 0 == ~st2~0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {87553#true} assume ~send2~0 == ~id2~0; {87553#true} is VALID [2022-02-20 18:52:07,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {87553#true} assume 0 == ~mode2~0 % 256; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {87553#true} assume ~id3~0 >= 0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {87553#true} assume 0 == ~st3~0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {87553#true} assume ~send3~0 == ~id3~0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {87553#true} assume 0 == ~mode3~0 % 256; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {87553#true} assume ~id4~0 >= 0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {87553#true} assume 0 == ~st4~0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {87553#true} assume ~send4~0 == ~id4~0; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {87553#true} assume 0 == ~mode4~0 % 256; {87553#true} is VALID [2022-02-20 18:52:07,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {87553#true} assume ~id1~0 != ~id2~0; {87553#true} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {87553#true} assume ~id1~0 != ~id3~0; {87553#true} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {87553#true} assume ~id1~0 != ~id4~0; {87553#true} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {87553#true} assume ~id2~0 != ~id3~0; {87553#true} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {87553#true} assume ~id2~0 != ~id4~0; {87553#true} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {87553#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {87555#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:52:07,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {87555#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {87553#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {87553#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {87553#true} assume ~send1~0 != ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {87553#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {87553#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {87553#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {87553#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {87553#true} is VALID [2022-02-20 18:52:07,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {87553#true} assume ~send2~0 != ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {87553#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {87553#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {87553#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {87553#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {87553#true} assume ~send3~0 != ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {87553#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {87553#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {87553#true} is VALID [2022-02-20 18:52:07,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {87553#true} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {87553#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {87553#true} assume ~send4~0 != ~nomsg~0; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {87553#true} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {87553#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {87553#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;havoc main_~check__tmp~0#1; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {87553#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {87553#true} assume !(~r1~0 >= 4); {87553#true} is VALID [2022-02-20 18:52:08,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {87553#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {87553#true} is VALID [2022-02-20 18:52:08,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {87553#true} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {87556#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:52:08,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {87556#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_3032~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3032~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {87557#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:52:08,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {87557#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {87554#false} is VALID [2022-02-20 18:52:08,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {87554#false} assume !false; {87554#false} is VALID [2022-02-20 18:52:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:08,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:08,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243152710] [2022-02-20 18:52:08,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243152710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:08,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:08,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:52:08,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674110567] [2022-02-20 18:52:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:08,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:08,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:08,027 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 18:52:08,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:08,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:08,029 INFO L87 Difference]: Start difference. First operand 2566 states and 3733 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,936 INFO L93 Difference]: Finished difference Result 4888 states and 7077 transitions. [2022-02-20 18:52:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-02-20 18:52:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 18:52:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-02-20 18:52:18,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 182 transitions. [2022-02-20 18:52:19,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,917 INFO L225 Difference]: With dead ends: 4888 [2022-02-20 18:52:19,917 INFO L226 Difference]: Without dead ends: 4886 [2022-02-20 18:52:19,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:19,919 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 138 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 463 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states.