./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.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.5.1.ufo.BOUNDED-10.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 57425e6703a3285008157cd8157da2d7bfae6570ff511478ed083b6b19ed0aed --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:42,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:42,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:42,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:42,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:42,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:42,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:42,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:42,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:42,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:42,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:42,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:42,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:42,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:42,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:42,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:42,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:42,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:42,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:42,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:42,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:42,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:42,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:42,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:42,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:42,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:42,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:42,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:42,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:42,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:42,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:42,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:42,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:42,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:42,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:42,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:42,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:42,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:42,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:42,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:42,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:42,226 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:52:42,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:42,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:42,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:42,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:42,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:42,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:42,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:42,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:42,249 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:42,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:42,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:42,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:42,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:42,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:42,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:42,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:42,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:42,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:42,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:42,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:42,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:42,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:42,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:42,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:42,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:42,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:42,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:42,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:42,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:42,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:42,255 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:42,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:42,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:42,256 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 -> 57425e6703a3285008157cd8157da2d7bfae6570ff511478ed083b6b19ed0aed [2022-02-20 18:52:42,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:42,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:42,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:42,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:42,504 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:42,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2022-02-20 18:52:42,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff65aaa1/015c8c96b32647d6a7a7eb32fb0d9b34/FLAG5b415338c [2022-02-20 18:52:42,923 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:42,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2022-02-20 18:52:42,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff65aaa1/015c8c96b32647d6a7a7eb32fb0d9b34/FLAG5b415338c [2022-02-20 18:52:43,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff65aaa1/015c8c96b32647d6a7a7eb32fb0d9b34 [2022-02-20 18:52:43,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:43,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:43,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:43,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:43,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:43,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cb0b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43, skipping insertion in model container [2022-02-20 18:52:43,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:43,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:43,580 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.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[5771,5784] [2022-02-20 18:52:43,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:43,619 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:43,651 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.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[5771,5784] [2022-02-20 18:52:43,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:43,689 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:43,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43 WrapperNode [2022-02-20 18:52:43,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:43,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:43,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:43,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:43,698 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:52:43" (1/1) ... [2022-02-20 18:52:43,705 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:52:43" (1/1) ... [2022-02-20 18:52:43,756 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 418 [2022-02-20 18:52:43,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:43,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:43,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:43,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:43,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:43,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:43,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:43,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:43,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (1/1) ... [2022-02-20 18:52:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:43,831 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:52:43,832 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:52:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:43,958 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:43,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:44,421 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:44,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:44,427 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:44,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:44 BoogieIcfgContainer [2022-02-20 18:52:44,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:44,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:44,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:44,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:44,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:43" (1/3) ... [2022-02-20 18:52:44,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ecc332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:44, skipping insertion in model container [2022-02-20 18:52:44,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:43" (2/3) ... [2022-02-20 18:52:44,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ecc332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:44, skipping insertion in model container [2022-02-20 18:52:44,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:44" (3/3) ... [2022-02-20 18:52:44,436 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2022-02-20 18:52:44,440 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:44,440 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:52:44,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:44,481 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:52:44,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:52:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:44,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:44,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:44,515 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -857023919, now seen corresponding path program 1 times [2022-02-20 18:52:44,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:44,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018752203] [2022-02-20 18:52:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:44,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {100#true} is VALID [2022-02-20 18:52:44,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {100#true} is VALID [2022-02-20 18:52:44,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} assume 0 == ~r1~0; {100#true} is VALID [2022-02-20 18:52:44,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#true} assume ~id1~0 >= 0; {100#true} is VALID [2022-02-20 18:52:44,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#true} assume 0 == ~st1~0; {100#true} is VALID [2022-02-20 18:52:44,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} assume ~send1~0 == ~id1~0; {100#true} is VALID [2022-02-20 18:52:44,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#true} assume 0 == ~mode1~0 % 256; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {102#(= (+ (* (- 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {102#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:44,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {102#(= (+ (* (- 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {101#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:52:44,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {101#false} ~mode1~0 := 0; {101#false} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {101#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {101#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {101#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {101#false} ~mode2~0 := 0; {101#false} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {101#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {101#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {101#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:52:44,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {101#false} ~mode3~0 := 0; {101#false} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {101#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {101#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {101#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {101#false} ~mode4~0 := 0; {101#false} is VALID [2022-02-20 18:52:44,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {101#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {101#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:52:44,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {101#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {101#false} ~mode5~0 := 0; {101#false} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {101#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {101#false} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {101#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {101#false} is VALID [2022-02-20 18:52:44,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {101#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {101#false} is VALID [2022-02-20 18:52:44,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {101#false} assume 0 == main_~assert__arg~0#1 % 256; {101#false} is VALID [2022-02-20 18:52:44,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {101#false} assume !false; {101#false} is VALID [2022-02-20 18:52:44,957 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:44,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:44,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018752203] [2022-02-20 18:52:44,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018752203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:44,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:44,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:44,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403228739] [2022-02-20 18:52:44,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:44,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:44,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:44,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:45,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:45,067 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,399 INFO L93 Difference]: Finished difference Result 215 states and 350 transitions. [2022-02-20 18:52:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-02-20 18:52:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-02-20 18:52:45,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 350 transitions. [2022-02-20 18:52:45,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,744 INFO L225 Difference]: With dead ends: 215 [2022-02-20 18:52:45,744 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 18:52:45,749 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:52:45,754 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 115 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 341 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:52:45,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 341 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 18:52:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-02-20 18:52:45,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:45,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have 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:45,787 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have 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:45,788 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have 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:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,794 INFO L93 Difference]: Finished difference Result 146 states and 210 transitions. [2022-02-20 18:52:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 210 transitions. [2022-02-20 18:52:45,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 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 146 states. [2022-02-20 18:52:45,797 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 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 146 states. [2022-02-20 18:52:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,808 INFO L93 Difference]: Finished difference Result 146 states and 210 transitions. [2022-02-20 18:52:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 210 transitions. [2022-02-20 18:52:45,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:45,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have 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:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2022-02-20 18:52:45,820 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 59 [2022-02-20 18:52:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:45,821 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2022-02-20 18:52:45,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2022-02-20 18:52:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:45,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:45,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:45,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:45,829 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1265777508, now seen corresponding path program 1 times [2022-02-20 18:52:45,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:45,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241339453] [2022-02-20 18:52:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:45,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {868#true} is VALID [2022-02-20 18:52:45,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {868#true} is VALID [2022-02-20 18:52:45,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume 0 == ~r1~0; {868#true} is VALID [2022-02-20 18:52:45,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {868#true} assume ~id1~0 >= 0; {868#true} is VALID [2022-02-20 18:52:45,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {868#true} assume 0 == ~st1~0; {868#true} is VALID [2022-02-20 18:52:45,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} assume ~send1~0 == ~id1~0; {868#true} is VALID [2022-02-20 18:52:45,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#true} assume 0 == ~mode1~0 % 256; {868#true} is VALID [2022-02-20 18:52:45,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {868#true} assume ~id2~0 >= 0; {868#true} is VALID [2022-02-20 18:52:45,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {868#true} assume 0 == ~st2~0; {868#true} is VALID [2022-02-20 18:52:45,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {868#true} assume ~send2~0 == ~id2~0; {868#true} is VALID [2022-02-20 18:52:45,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#true} assume 0 == ~mode2~0 % 256; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {870#(= (+ (* (- 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {870#(= (+ (* (- 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; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {870#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:45,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {870#(= (+ (* (- 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; {869#false} is VALID [2022-02-20 18:52:45,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {869#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {869#false} is VALID [2022-02-20 18:52:45,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {869#false} ~mode2~0 := 0; {869#false} is VALID [2022-02-20 18:52:45,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {869#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {869#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {869#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {869#false} is VALID [2022-02-20 18:52:45,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {869#false} ~mode3~0 := 0; {869#false} is VALID [2022-02-20 18:52:45,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {869#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {869#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {869#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {869#false} is VALID [2022-02-20 18:52:45,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {869#false} ~mode4~0 := 0; {869#false} is VALID [2022-02-20 18:52:45,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {869#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {869#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {869#false} is VALID [2022-02-20 18:52:45,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {869#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {869#false} is VALID [2022-02-20 18:52:45,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {869#false} ~mode5~0 := 0; {869#false} is VALID [2022-02-20 18:52:45,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {869#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {869#false} is VALID [2022-02-20 18:52:45,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {869#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {869#false} is VALID [2022-02-20 18:52:45,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {869#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {869#false} is VALID [2022-02-20 18:52:45,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {869#false} assume 0 == main_~assert__arg~0#1 % 256; {869#false} is VALID [2022-02-20 18:52:45,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-02-20 18:52:45,944 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:45,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:45,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241339453] [2022-02-20 18:52:45,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241339453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:45,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:45,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:45,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337719116] [2022-02-20 18:52:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:52:45,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:45,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:45,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:45,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:45,994 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,221 INFO L93 Difference]: Finished difference Result 348 states and 533 transitions. [2022-02-20 18:52:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:52:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:46,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2022-02-20 18:52:46,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:46,490 INFO L225 Difference]: With dead ends: 348 [2022-02-20 18:52:46,491 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 18:52:46,497 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:52:46,499 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 80 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 293 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:52:46,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 293 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 18:52:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-02-20 18:52:46,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:46,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:46,528 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:46,529 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,539 INFO L93 Difference]: Finished difference Result 238 states and 356 transitions. [2022-02-20 18:52:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 356 transitions. [2022-02-20 18:52:46,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:46,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:46,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 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 238 states. [2022-02-20 18:52:46,545 INFO L87 Difference]: Start difference. First operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 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 238 states. [2022-02-20 18:52:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,553 INFO L93 Difference]: Finished difference Result 238 states and 356 transitions. [2022-02-20 18:52:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 356 transitions. [2022-02-20 18:52:46,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:46,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:46,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:46,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2022-02-20 18:52:46,562 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 60 [2022-02-20 18:52:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:46,562 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2022-02-20 18:52:46,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2022-02-20 18:52:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:46,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:46,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:46,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:46,564 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash -943758039, now seen corresponding path program 1 times [2022-02-20 18:52:46,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:46,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019102435] [2022-02-20 18:52:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:46,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {2136#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {2136#true} is VALID [2022-02-20 18:52:46,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {2136#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2136#true} is VALID [2022-02-20 18:52:46,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2136#true} assume 0 == ~r1~0; {2136#true} is VALID [2022-02-20 18:52:46,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {2136#true} assume ~id1~0 >= 0; {2136#true} is VALID [2022-02-20 18:52:46,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {2136#true} assume 0 == ~st1~0; {2136#true} is VALID [2022-02-20 18:52:46,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {2136#true} assume ~send1~0 == ~id1~0; {2136#true} is VALID [2022-02-20 18:52:46,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {2136#true} assume 0 == ~mode1~0 % 256; {2136#true} is VALID [2022-02-20 18:52:46,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2136#true} assume ~id2~0 >= 0; {2136#true} is VALID [2022-02-20 18:52:46,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#true} assume 0 == ~st2~0; {2136#true} is VALID [2022-02-20 18:52:46,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#true} assume ~send2~0 == ~id2~0; {2136#true} is VALID [2022-02-20 18:52:46,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {2136#true} assume 0 == ~mode2~0 % 256; {2136#true} is VALID [2022-02-20 18:52:46,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#true} assume ~id3~0 >= 0; {2136#true} is VALID [2022-02-20 18:52:46,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {2136#true} assume 0 == ~st3~0; {2136#true} is VALID [2022-02-20 18:52:46,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {2136#true} assume ~send3~0 == ~id3~0; {2136#true} is VALID [2022-02-20 18:52:46,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#true} assume 0 == ~mode3~0 % 256; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {2138#(= (+ (* (- 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {2138#(= (+ (* (- 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; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {2138#(= (+ (* (- 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; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2138#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:46,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {2138#(= (+ (* (- 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; {2137#false} is VALID [2022-02-20 18:52:46,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {2137#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {2137#false} is VALID [2022-02-20 18:52:46,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {2137#false} ~mode3~0 := 0; {2137#false} is VALID [2022-02-20 18:52:46,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {2137#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2137#false} is VALID [2022-02-20 18:52:46,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {2137#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {2137#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {2137#false} ~mode4~0 := 0; {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {2137#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {2137#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {2137#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {2137#false} ~mode5~0 := 0; {2137#false} is VALID [2022-02-20 18:52:46,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {2137#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2137#false} is VALID [2022-02-20 18:52:46,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {2137#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {2137#false} is VALID [2022-02-20 18:52:46,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {2137#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {2137#false} is VALID [2022-02-20 18:52:46,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {2137#false} assume 0 == main_~assert__arg~0#1 % 256; {2137#false} is VALID [2022-02-20 18:52:46,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2022-02-20 18:52:46,664 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:46,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:46,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019102435] [2022-02-20 18:52:46,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019102435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:46,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:46,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:46,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681323160] [2022-02-20 18:52:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:46,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:46,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:46,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:46,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:46,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:46,713 INFO L87 Difference]: Start difference. First operand 236 states and 355 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,929 INFO L93 Difference]: Finished difference Result 608 states and 945 transitions. [2022-02-20 18:52:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:46,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2022-02-20 18:52:47,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,188 INFO L225 Difference]: With dead ends: 608 [2022-02-20 18:52:47,188 INFO L226 Difference]: Without dead ends: 406 [2022-02-20 18:52:47,189 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:52:47,190 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 75 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 289 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:52:47,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-02-20 18:52:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2022-02-20 18:52:47,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:47,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:47,219 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:47,220 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,233 INFO L93 Difference]: Finished difference Result 406 states and 620 transitions. [2022-02-20 18:52:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 620 transitions. [2022-02-20 18:52:47,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:47,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:47,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 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 406 states. [2022-02-20 18:52:47,236 INFO L87 Difference]: Start difference. First operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 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 406 states. [2022-02-20 18:52:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,249 INFO L93 Difference]: Finished difference Result 406 states and 620 transitions. [2022-02-20 18:52:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 620 transitions. [2022-02-20 18:52:47,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:47,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:47,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:47,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 403 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 619 transitions. [2022-02-20 18:52:47,271 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 619 transitions. Word has length 61 [2022-02-20 18:52:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:47,272 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 619 transitions. [2022-02-20 18:52:47,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 619 transitions. [2022-02-20 18:52:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:47,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:47,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:47,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:47,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1997598018, now seen corresponding path program 1 times [2022-02-20 18:52:47,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:47,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048018906] [2022-02-20 18:52:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:47,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {4341#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {4341#true} is VALID [2022-02-20 18:52:47,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {4341#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {4341#true} is VALID [2022-02-20 18:52:47,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {4341#true} assume 0 == ~r1~0; {4341#true} is VALID [2022-02-20 18:52:47,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {4341#true} assume ~id1~0 >= 0; {4341#true} is VALID [2022-02-20 18:52:47,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {4341#true} assume 0 == ~st1~0; {4341#true} is VALID [2022-02-20 18:52:47,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {4341#true} assume ~send1~0 == ~id1~0; {4341#true} is VALID [2022-02-20 18:52:47,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {4341#true} assume 0 == ~mode1~0 % 256; {4341#true} is VALID [2022-02-20 18:52:47,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {4341#true} assume ~id2~0 >= 0; {4341#true} is VALID [2022-02-20 18:52:47,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {4341#true} assume 0 == ~st2~0; {4341#true} is VALID [2022-02-20 18:52:47,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {4341#true} assume ~send2~0 == ~id2~0; {4341#true} is VALID [2022-02-20 18:52:47,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {4341#true} assume 0 == ~mode2~0 % 256; {4341#true} is VALID [2022-02-20 18:52:47,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {4341#true} assume ~id3~0 >= 0; {4341#true} is VALID [2022-02-20 18:52:47,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {4341#true} assume 0 == ~st3~0; {4341#true} is VALID [2022-02-20 18:52:47,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {4341#true} assume ~send3~0 == ~id3~0; {4341#true} is VALID [2022-02-20 18:52:47,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {4341#true} assume 0 == ~mode3~0 % 256; {4341#true} is VALID [2022-02-20 18:52:47,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {4341#true} assume ~id4~0 >= 0; {4341#true} is VALID [2022-02-20 18:52:47,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {4341#true} assume 0 == ~st4~0; {4341#true} is VALID [2022-02-20 18:52:47,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {4341#true} assume ~send4~0 == ~id4~0; {4341#true} is VALID [2022-02-20 18:52:47,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {4341#true} assume 0 == ~mode4~0 % 256; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {4343#(= (+ (* (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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {4343#(= (+ (* (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; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {4343#(= (+ (* (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; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {4343#(= (+ (* (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; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4343#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {4343#(= (+ (* (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; {4342#false} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {4342#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {4342#false} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {4342#false} ~mode4~0 := 0; {4342#false} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {4342#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {4342#false} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {4342#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4342#false} is VALID [2022-02-20 18:52:47,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {4342#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {4342#false} is VALID [2022-02-20 18:52:47,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {4342#false} ~mode5~0 := 0; {4342#false} is VALID [2022-02-20 18:52:47,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {4342#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4342#false} is VALID [2022-02-20 18:52:47,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {4342#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {4342#false} is VALID [2022-02-20 18:52:47,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {4342#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {4342#false} is VALID [2022-02-20 18:52:47,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {4342#false} assume 0 == main_~assert__arg~0#1 % 256; {4342#false} is VALID [2022-02-20 18:52:47,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {4342#false} assume !false; {4342#false} is VALID [2022-02-20 18:52:47,384 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:47,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:47,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048018906] [2022-02-20 18:52:47,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048018906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:47,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:47,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:47,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744208794] [2022-02-20 18:52:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:47,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:52:47,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:47,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:47,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:47,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:47,439 INFO L87 Difference]: Start difference. First operand 404 states and 619 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,715 INFO L93 Difference]: Finished difference Result 1080 states and 1685 transitions. [2022-02-20 18:52:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:47,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:52:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:47,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2022-02-20 18:52:47,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,969 INFO L225 Difference]: With dead ends: 1080 [2022-02-20 18:52:47,970 INFO L226 Difference]: Without dead ends: 710 [2022-02-20 18:52:47,971 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:52:47,972 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 70 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 285 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:52:47,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 285 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-02-20 18:52:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 708. [2022-02-20 18:52:48,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:48,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 710 states. Second operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have 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:48,018 INFO L74 IsIncluded]: Start isIncluded. First operand 710 states. Second operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have 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:48,019 INFO L87 Difference]: Start difference. First operand 710 states. Second operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have 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:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,044 INFO L93 Difference]: Finished difference Result 710 states and 1092 transitions. [2022-02-20 18:52:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1092 transitions. [2022-02-20 18:52:48,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 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 710 states. [2022-02-20 18:52:48,048 INFO L87 Difference]: Start difference. First operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 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 710 states. [2022-02-20 18:52:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,073 INFO L93 Difference]: Finished difference Result 710 states and 1092 transitions. [2022-02-20 18:52:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1092 transitions. [2022-02-20 18:52:48,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:48,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.5431400282885432) internal successors, (1091), 707 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have 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:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1091 transitions. [2022-02-20 18:52:48,115 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1091 transitions. Word has length 62 [2022-02-20 18:52:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:48,115 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 1091 transitions. [2022-02-20 18:52:48,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1091 transitions. [2022-02-20 18:52:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:48,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:48,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:48,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:48,117 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1910647641, now seen corresponding path program 1 times [2022-02-20 18:52:48,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:48,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536391838] [2022-02-20 18:52:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:48,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {8246#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {8246#true} is VALID [2022-02-20 18:52:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {8246#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {8246#true} is VALID [2022-02-20 18:52:48,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {8246#true} assume 0 == ~r1~0; {8246#true} is VALID [2022-02-20 18:52:48,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {8246#true} assume ~id1~0 >= 0; {8246#true} is VALID [2022-02-20 18:52:48,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {8246#true} assume 0 == ~st1~0; {8246#true} is VALID [2022-02-20 18:52:48,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {8246#true} assume ~send1~0 == ~id1~0; {8246#true} is VALID [2022-02-20 18:52:48,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {8246#true} assume 0 == ~mode1~0 % 256; {8246#true} is VALID [2022-02-20 18:52:48,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {8246#true} assume ~id2~0 >= 0; {8246#true} is VALID [2022-02-20 18:52:48,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {8246#true} assume 0 == ~st2~0; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {8246#true} assume ~send2~0 == ~id2~0; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {8246#true} assume 0 == ~mode2~0 % 256; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {8246#true} assume ~id3~0 >= 0; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {8246#true} assume 0 == ~st3~0; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {8246#true} assume ~send3~0 == ~id3~0; {8246#true} is VALID [2022-02-20 18:52:48,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {8246#true} assume 0 == ~mode3~0 % 256; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {8246#true} assume ~id4~0 >= 0; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {8246#true} assume 0 == ~st4~0; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {8246#true} assume ~send4~0 == ~id4~0; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {8246#true} assume 0 == ~mode4~0 % 256; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {8246#true} assume ~id5~0 >= 0; {8246#true} is VALID [2022-02-20 18:52:48,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {8246#true} assume 0 == ~st5~0; {8246#true} is VALID [2022-02-20 18:52:48,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {8246#true} assume ~send5~0 == ~id5~0; {8246#true} is VALID [2022-02-20 18:52:48,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {8246#true} assume 0 == ~mode5~0 % 256; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0); {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {8248#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8247#false} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {8247#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {8247#false} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {8247#false} ~mode5~0 := 0; {8247#false} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {8247#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8247#false} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {8247#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {8247#false} is VALID [2022-02-20 18:52:48,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {8247#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {8247#false} is VALID [2022-02-20 18:52:48,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {8247#false} assume 0 == main_~assert__arg~0#1 % 256; {8247#false} is VALID [2022-02-20 18:52:48,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {8247#false} assume !false; {8247#false} is VALID [2022-02-20 18:52:48,256 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:48,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:48,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536391838] [2022-02-20 18:52:48,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536391838] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:48,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:48,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:48,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556085048] [2022-02-20 18:52:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:48,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:48,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:48,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:48,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:48,304 INFO L87 Difference]: Start difference. First operand 708 states and 1091 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,731 INFO L93 Difference]: Finished difference Result 1928 states and 2997 transitions. [2022-02-20 18:52:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 18:52:48,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2022-02-20 18:52:48,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:49,050 INFO L225 Difference]: With dead ends: 1928 [2022-02-20 18:52:49,050 INFO L226 Difference]: Without dead ends: 1254 [2022-02-20 18:52:49,051 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:52:49,052 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 65 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 281 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:52:49,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 281 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-02-20 18:52:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2022-02-20 18:52:49,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:49,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1254 states. Second operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have 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:49,125 INFO L74 IsIncluded]: Start isIncluded. First operand 1254 states. Second operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have 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:49,127 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have 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:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,196 INFO L93 Difference]: Finished difference Result 1254 states and 1924 transitions. [2022-02-20 18:52:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1924 transitions. [2022-02-20 18:52:49,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:49,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:49,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 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 1254 states. [2022-02-20 18:52:49,204 INFO L87 Difference]: Start difference. First operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 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 1254 states. [2022-02-20 18:52:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,275 INFO L93 Difference]: Finished difference Result 1254 states and 1924 transitions. [2022-02-20 18:52:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1924 transitions. [2022-02-20 18:52:49,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:49,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:49,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:49,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.5371702637889688) internal successors, (1923), 1251 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have 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:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1923 transitions. [2022-02-20 18:52:49,374 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1923 transitions. Word has length 63 [2022-02-20 18:52:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:49,374 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1923 transitions. [2022-02-20 18:52:49,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1923 transitions. [2022-02-20 18:52:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:49,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:49,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:49,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:49,376 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2007440880, now seen corresponding path program 1 times [2022-02-20 18:52:49,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:49,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025981468] [2022-02-20 18:52:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:49,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {15203#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {15203#true} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {15203#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {15203#true} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {15203#true} assume 0 == ~r1~0; {15203#true} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {15203#true} assume ~id1~0 >= 0; {15203#true} is VALID [2022-02-20 18:52:49,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {15203#true} assume 0 == ~st1~0; {15205#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {15205#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {15205#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {15205#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {15205#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {15205#(<= ~st1~0 0)} assume ~id2~0 >= 0; {15205#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:49,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {15205#(<= ~st1~0 0)} assume 0 == ~st2~0; {15206#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {15206#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {15206#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {15206#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15206#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {15206#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {15206#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {15206#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {15207#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {15208#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {15209#(<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0); {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {15209#(<= (+ ~st5~0 ~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; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {15209#(<= (+ ~st5~0 ~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; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0); {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {15209#(<= (+ ~st5~0 ~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; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {15209#(<= (+ ~st5~0 ~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; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,485 INFO L290 TraceCheckUtils]: 55: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,486 INFO L290 TraceCheckUtils]: 56: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0); {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {15209#(<= (+ ~st5~0 ~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:49,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {15209#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {15204#false} is VALID [2022-02-20 18:52:49,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {15204#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {15204#false} is VALID [2022-02-20 18:52:49,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {15204#false} assume 0 == main_~assert__arg~0#1 % 256; {15204#false} is VALID [2022-02-20 18:52:49,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {15204#false} assume !false; {15204#false} is VALID [2022-02-20 18:52:49,489 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:49,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:49,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025981468] [2022-02-20 18:52:49,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025981468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:49,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:49,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:49,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629356959] [2022-02-20 18:52:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:49,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:49,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:49,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:49,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:52:49,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:52:49,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:49,542 INFO L87 Difference]: Start difference. First operand 1252 states and 1923 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:53:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:03,706 INFO L93 Difference]: Finished difference Result 13432 states and 20813 transitions. [2022-02-20 18:53:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:53:03,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:53:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1079 transitions. [2022-02-20 18:53:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:53:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1079 transitions. [2022-02-20 18:53:03,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1079 transitions. [2022-02-20 18:53:04,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1079 edges. 1079 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:10,611 INFO L225 Difference]: With dead ends: 13432 [2022-02-20 18:53:10,611 INFO L226 Difference]: Without dead ends: 12214 [2022-02-20 18:53:10,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:53:10,615 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 1155 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:10,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1155 Valid, 1423 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2022-02-20 18:53:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 2468. [2022-02-20 18:53:12,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:12,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12214 states. Second operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have 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:53:12,924 INFO L74 IsIncluded]: Start isIncluded. First operand 12214 states. Second operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have 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:53:12,928 INFO L87 Difference]: Start difference. First operand 12214 states. Second operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have 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:53:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:16,729 INFO L93 Difference]: Finished difference Result 12214 states and 18604 transitions. [2022-02-20 18:53:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 18604 transitions. [2022-02-20 18:53:16,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:16,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:16,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 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 12214 states. [2022-02-20 18:53:16,758 INFO L87 Difference]: Start difference. First operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 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 12214 states. [2022-02-20 18:53:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,607 INFO L93 Difference]: Finished difference Result 12214 states and 18604 transitions. [2022-02-20 18:53:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 18604 transitions. [2022-02-20 18:53:20,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:20,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.5188488042156465) internal successors, (3747), 2467 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have 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:53:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3747 transitions. [2022-02-20 18:53:20,886 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3747 transitions. Word has length 64 [2022-02-20 18:53:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:20,887 INFO L470 AbstractCegarLoop]: Abstraction has 2468 states and 3747 transitions. [2022-02-20 18:53:20,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:53:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3747 transitions. [2022-02-20 18:53:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:53:20,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:20,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:20,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:53:20,897 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash -190448501, now seen corresponding path program 1 times [2022-02-20 18:53:20,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:20,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105437961] [2022-02-20 18:53:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:21,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {62003#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {62003#true} is VALID [2022-02-20 18:53:21,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {62003#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {62003#true} is VALID [2022-02-20 18:53:21,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {62003#true} assume 0 == ~r1~0; {62003#true} is VALID [2022-02-20 18:53:21,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {62003#true} assume ~id1~0 >= 0; {62003#true} is VALID [2022-02-20 18:53:21,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {62003#true} assume 0 == ~st1~0; {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:21,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:21,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:21,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:21,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {62005#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:21,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:21,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:21,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:21,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {62006#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {62007#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:21,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {62008#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0); {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0); {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0); {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 5); {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:21,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {62009#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~0#1 := 0; {62004#false} is VALID [2022-02-20 18:53:21,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {62004#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {62004#false} is VALID [2022-02-20 18:53:21,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {62004#false} assume 0 == main_~assert__arg~0#1 % 256; {62004#false} is VALID [2022-02-20 18:53:21,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {62004#false} assume !false; {62004#false} is VALID [2022-02-20 18:53:21,195 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:53:21,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:21,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105437961] [2022-02-20 18:53:21,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105437961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:21,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:21,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:21,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721716679] [2022-02-20 18:53:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:53:21,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:21,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:21,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:21,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:21,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:21,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:21,263 INFO L87 Difference]: Start difference. First operand 2468 states and 3747 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:25,189 INFO L93 Difference]: Finished difference Result 4904 states and 7461 transitions. [2022-02-20 18:53:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:53:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2022-02-20 18:53:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2022-02-20 18:53:25,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 317 transitions. [2022-02-20 18:53:25,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:25,657 INFO L225 Difference]: With dead ends: 4904 [2022-02-20 18:53:25,657 INFO L226 Difference]: Without dead ends: 2470 [2022-02-20 18:53:25,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:53:25,660 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 251 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:25,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 582 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2022-02-20 18:53:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2022-02-20 18:53:27,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:27,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2470 states. Second operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have 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:53:27,925 INFO L74 IsIncluded]: Start isIncluded. First operand 2470 states. Second operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have 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:53:27,928 INFO L87 Difference]: Start difference. First operand 2470 states. Second operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have 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:53:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:28,069 INFO L93 Difference]: Finished difference Result 2470 states and 3716 transitions. [2022-02-20 18:53:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3716 transitions. [2022-02-20 18:53:28,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:28,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:28,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 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 2470 states. [2022-02-20 18:53:28,081 INFO L87 Difference]: Start difference. First operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 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 2470 states. [2022-02-20 18:53:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:28,255 INFO L93 Difference]: Finished difference Result 2470 states and 3716 transitions. [2022-02-20 18:53:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3716 transitions. [2022-02-20 18:53:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:28,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:28,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:28,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.5058775841102554) internal successors, (3715), 2467 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have 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:53:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3715 transitions. [2022-02-20 18:53:28,532 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3715 transitions. Word has length 66 [2022-02-20 18:53:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:28,532 INFO L470 AbstractCegarLoop]: Abstraction has 2468 states and 3715 transitions. [2022-02-20 18:53:28,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3715 transitions. [2022-02-20 18:53:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:53:28,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:28,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:28,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:53:28,534 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash -211451156, now seen corresponding path program 1 times [2022-02-20 18:53:28,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:28,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366495761] [2022-02-20 18:53:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:28,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {77306#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {77306#true} is VALID [2022-02-20 18:53:28,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {77306#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {77306#true} is VALID [2022-02-20 18:53:28,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {77306#true} assume 0 == ~r1~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {77308#(<= ~r1~0 0)} assume ~id1~0 >= 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~st1~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {77308#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {77308#(<= ~r1~0 0)} assume ~id2~0 >= 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~st2~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {77308#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {77308#(<= ~r1~0 0)} assume ~id3~0 >= 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~st3~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {77308#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {77308#(<= ~r1~0 0)} assume ~id4~0 >= 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~st4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {77308#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {77308#(<= ~r1~0 0)} assume ~id5~0 >= 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~st5~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {77308#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {77308#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {77308#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {77308#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {77308#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {77308#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {77308#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {77308#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {77308#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {77308#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {77308#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {77308#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {77308#(<= ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {77308#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {77308#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {77308#(<= ~r1~0 0)} assume !(~send1~0 != ~nomsg~0); {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {77308#(<= ~r1~0 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {77308#(<= ~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; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {77308#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {77308#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {77308#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {77308#(<= ~r1~0 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {77308#(<= ~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; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {77308#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {77308#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {77308#(<= ~r1~0 0)} assume !(~send3~0 != ~nomsg~0); {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {77308#(<= ~r1~0 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {77308#(<= ~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; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {77308#(<= ~r1~0 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {77308#(<= ~r1~0 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {77308#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {77308#(<= ~r1~0 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {77308#(<= ~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; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {77308#(<= ~r1~0 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {77308#(<= ~r1~0 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {77308#(<= ~r1~0 0)} assume !(~send5~0 != ~nomsg~0); {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {77308#(<= ~r1~0 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {77308#(<= ~r1~0 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {77308#(<= ~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {77308#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {77308#(<= ~r1~0 0)} is VALID [2022-02-20 18:53:28,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {77308#(<= ~r1~0 0)} assume ~r1~0 >= 5; {77307#false} is VALID [2022-02-20 18:53:28,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {77307#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1; {77307#false} is VALID [2022-02-20 18:53:28,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {77307#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {77307#false} is VALID [2022-02-20 18:53:28,629 INFO L290 TraceCheckUtils]: 64: Hoare triple {77307#false} assume 0 == main_~assert__arg~0#1 % 256; {77307#false} is VALID [2022-02-20 18:53:28,629 INFO L290 TraceCheckUtils]: 65: Hoare triple {77307#false} assume !false; {77307#false} is VALID [2022-02-20 18:53:28,629 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:53:28,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:28,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366495761] [2022-02-20 18:53:28,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366495761] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:28,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:28,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:28,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301044464] [2022-02-20 18:53:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:53:28,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:28,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:28,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:28,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:28,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:28,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:28,672 INFO L87 Difference]: Start difference. First operand 2468 states and 3715 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:33,628 INFO L93 Difference]: Finished difference Result 6074 states and 9159 transitions. [2022-02-20 18:53:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:53:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:53:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:53:33,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:53:33,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:34,402 INFO L225 Difference]: With dead ends: 6074 [2022-02-20 18:53:34,402 INFO L226 Difference]: Without dead ends: 3640 [2022-02-20 18:53:34,405 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:53:34,405 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 56 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 250 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:53:34,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 250 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2022-02-20 18:53:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3638. [2022-02-20 18:53:38,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:38,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3640 states. Second operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have 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:53:38,190 INFO L74 IsIncluded]: Start isIncluded. First operand 3640 states. Second operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have 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:53:38,195 INFO L87 Difference]: Start difference. First operand 3640 states. Second operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have 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:53:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:38,571 INFO L93 Difference]: Finished difference Result 3640 states and 5430 transitions. [2022-02-20 18:53:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5430 transitions. [2022-02-20 18:53:38,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:38,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:38,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 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 3640 states. [2022-02-20 18:53:38,593 INFO L87 Difference]: Start difference. First operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 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 3640 states. [2022-02-20 18:53:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:39,023 INFO L93 Difference]: Finished difference Result 3640 states and 5430 transitions. [2022-02-20 18:53:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5430 transitions. [2022-02-20 18:53:39,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:39,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:39,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:39,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 3637 states have (on average 1.4927137750893593) internal successors, (5429), 3637 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have 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:53:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 5429 transitions. [2022-02-20 18:53:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 5429 transitions. Word has length 66 [2022-02-20 18:53:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:39,554 INFO L470 AbstractCegarLoop]: Abstraction has 3638 states and 5429 transitions. [2022-02-20 18:53:39,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:53:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5429 transitions. [2022-02-20 18:53:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:53:39,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:39,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:39,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:53:39,556 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1610845590, now seen corresponding path program 1 times [2022-02-20 18:53:39,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:39,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351374017] [2022-02-20 18:53:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:39,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {98273#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(51, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6229~0 := 0;~__return_6343~0 := 0;~__return_6424~0 := 0; {98275#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:39,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {98275#(<= (+ ~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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {98275#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:39,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {98275#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {98275#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:39,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {98275#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {98276#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:39,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {98276#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {98276#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:39,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {98276#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {98277#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {98277#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:39,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {98277#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {98274#false} is VALID [2022-02-20 18:53:39,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {98274#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {98274#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; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {98274#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {98274#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {98274#false} assume ~send2~0 != ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {98274#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {98274#false} is VALID [2022-02-20 18:53:39,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {98274#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; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {98274#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {98274#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {98274#false} assume !(~send3~0 != ~nomsg~0); {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {98274#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {98274#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; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {98274#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {98274#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {98274#false} assume ~send4~0 != ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {98274#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {98274#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; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {98274#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {98274#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {98274#false} assume !(~send5~0 != ~nomsg~0); {98274#false} is VALID [2022-02-20 18:53:39,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {98274#false} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {98274#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {98274#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {98274#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {98274#false} assume !(~r1~0 >= 5); {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {98274#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {98274#false} is VALID [2022-02-20 18:53:39,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {98274#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1; {98274#false} is VALID [2022-02-20 18:53:39,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {98274#false} ~__return_6343~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6343~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; {98274#false} is VALID [2022-02-20 18:53:39,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {98274#false} assume 0 == main_~assert__arg~0#1 % 256; {98274#false} is VALID [2022-02-20 18:53:39,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {98274#false} assume !false; {98274#false} is VALID [2022-02-20 18:53:39,641 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:53:39,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:39,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351374017] [2022-02-20 18:53:39,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351374017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:39,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:39,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:39,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142657552] [2022-02-20 18:53:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:53:39,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:39,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:39,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:39,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:39,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:39,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:39,687 INFO L87 Difference]: Start difference. First operand 3638 states and 5429 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)