./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.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 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:15,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:15,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:15,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:15,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:15,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:15,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:15,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:15,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:15,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:15,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:15,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:15,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:15,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:15,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:15,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:15,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:15,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:15,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:15,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:15,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:15,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:15,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:15,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:15,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:15,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:15,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:15,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:15,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:15,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:15,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:15,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:15,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:15,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:15,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:15,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:15,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:15,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:15,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:15,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:15,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:15,068 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:15,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:15,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:15,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:15,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:15,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:15,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:15,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:15,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:15,087 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:15,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:15,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:15,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:15,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:15,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:15,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:15,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:15,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:15,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:15,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:15,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:15,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:15,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:15,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:15,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:15,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:15,091 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:15,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:15,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:15,092 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 -> 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c [2022-02-20 18:52:15,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:15,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:15,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:15,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:15,347 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:15,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:52:15,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f930e649b/0e7d0df753ac4a559cbc3ce00a3084b4/FLAG72139cbe2 [2022-02-20 18:52:15,746 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:15,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:52:15,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f930e649b/0e7d0df753ac4a559cbc3ce00a3084b4/FLAG72139cbe2 [2022-02-20 18:52:15,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f930e649b/0e7d0df753ac4a559cbc3ce00a3084b4 [2022-02-20 18:52:15,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:15,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:15,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:15,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:15,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:15,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:15" (1/1) ... [2022-02-20 18:52:15,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:15, skipping insertion in model container [2022-02-20 18:52:15,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:15" (1/1) ... [2022-02-20 18:52:15,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:15,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:15,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2022-02-20 18:52:16,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:16,015 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:16,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2022-02-20 18:52:16,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:16,075 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:16,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:16 WrapperNode [2022-02-20 18:52:16,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:16,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:16,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:16,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:16,081 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:16" (1/1) ... [2022-02-20 18:52:16,096 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:16" (1/1) ... [2022-02-20 18:52:16,126 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 338 [2022-02-20 18:52:16,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:16,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:16,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:16,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:16,138 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:16" (1/1) ... [2022-02-20 18:52:16,138 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:16" (1/1) ... [2022-02-20 18:52:16,148 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:16" (1/1) ... [2022-02-20 18:52:16,152 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:16" (1/1) ... [2022-02-20 18:52:16,158 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:16" (1/1) ... [2022-02-20 18:52:16,162 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:16" (1/1) ... [2022-02-20 18:52:16,163 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:16" (1/1) ... [2022-02-20 18:52:16,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:16,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:16,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:16,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:16,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:16" (1/1) ... [2022-02-20 18:52:16,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:16,232 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:16,240 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:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:16,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:16,423 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:16,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:16,953 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:16,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:16,958 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:16,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:16 BoogieIcfgContainer [2022-02-20 18:52:16,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:16,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:16,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:16,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:16,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:15" (1/3) ... [2022-02-20 18:52:16,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be5f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:16, skipping insertion in model container [2022-02-20 18:52:16,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:16" (2/3) ... [2022-02-20 18:52:16,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be5f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:16, skipping insertion in model container [2022-02-20 18:52:16,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:16" (3/3) ... [2022-02-20 18:52:16,969 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:52:16,978 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:16,979 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:52:17,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:17,023 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:17,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:52:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call 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:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:52:17,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:17,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:17,046 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 377049112, now seen corresponding path program 1 times [2022-02-20 18:52:17,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:17,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992187996] [2022-02-20 18:52:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:17,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {84#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {84#true} is VALID [2022-02-20 18:52:17,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {84#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {84#true} is VALID [2022-02-20 18:52:17,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 == ~r1~0 % 256; {84#true} is VALID [2022-02-20 18:52:17,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#true} assume ~id1~0 >= 0; {84#true} is VALID [2022-02-20 18:52:17,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#true} assume 0 == ~st1~0; {84#true} is VALID [2022-02-20 18:52:17,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#true} assume ~send1~0 == ~id1~0; {84#true} is VALID [2022-02-20 18:52:17,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {84#true} assume 0 == ~mode1~0 % 256; {84#true} is VALID [2022-02-20 18:52:17,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#true} assume ~id2~0 >= 0; {84#true} is VALID [2022-02-20 18:52:17,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#true} assume 0 == ~st2~0; {84#true} is VALID [2022-02-20 18:52:17,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#true} assume ~send2~0 == ~id2~0; {84#true} is VALID [2022-02-20 18:52:17,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#true} assume 0 == ~mode2~0 % 256; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {86#(= (+ (* (- 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; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {86#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:52:17,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {86#(= (+ (* (- 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; {85#false} is VALID [2022-02-20 18:52:17,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {85#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {85#false} is VALID [2022-02-20 18:52:17,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {85#false} ~mode2~0 := 0; {85#false} is VALID [2022-02-20 18:52:17,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {85#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {85#false} is VALID [2022-02-20 18:52:17,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {85#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {85#false} is VALID [2022-02-20 18:52:17,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {85#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {85#false} is VALID [2022-02-20 18:52:17,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {85#false} ~mode3~0 := 0; {85#false} is VALID [2022-02-20 18:52:17,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {85#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {85#false} is VALID [2022-02-20 18:52:17,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {85#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {85#false} is VALID [2022-02-20 18:52:17,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {85#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {85#false} is VALID [2022-02-20 18:52:17,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {85#false} ~mode4~0 := 0; {85#false} is VALID [2022-02-20 18:52:17,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {85#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {85#false} is VALID [2022-02-20 18:52:17,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {85#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {85#false} is VALID [2022-02-20 18:52:17,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {85#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {85#false} is VALID [2022-02-20 18:52:17,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {85#false} assume 0 == main_~assert__arg~0#1 % 256; {85#false} is VALID [2022-02-20 18:52:17,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {85#false} assume !false; {85#false} is VALID [2022-02-20 18:52:17,446 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:17,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:17,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992187996] [2022-02-20 18:52:17,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992187996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:17,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:17,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:17,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808184676] [2022-02-20 18:52:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:52:17,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:17,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:17,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:17,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:17,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:17,550 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 0 states have call successors, (0), 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 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:17,818 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2022-02-20 18:52:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:52:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2022-02-20 18:52:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2022-02-20 18:52:17,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 292 transitions. [2022-02-20 18:52:18,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,073 INFO L225 Difference]: With dead ends: 183 [2022-02-20 18:52:18,073 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 18:52:18,075 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:18,077 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 273 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:18,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 273 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:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 18:52:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-02-20 18:52:18,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:18,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,110 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,111 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,117 INFO L93 Difference]: Finished difference Result 122 states and 176 transitions. [2022-02-20 18:52:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2022-02-20 18:52:18,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:18,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:18,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 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 122 states. [2022-02-20 18:52:18,119 INFO L87 Difference]: Start difference. First operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 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 122 states. [2022-02-20 18:52:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,124 INFO L93 Difference]: Finished difference Result 122 states and 176 transitions. [2022-02-20 18:52:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2022-02-20 18:52:18,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:18,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:18,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:18,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2022-02-20 18:52:18,144 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 48 [2022-02-20 18:52:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:18,145 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2022-02-20 18:52:18,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2022-02-20 18:52:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:52:18,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:18,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:18,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:18,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 292717965, now seen corresponding path program 1 times [2022-02-20 18:52:18,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:18,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141180033] [2022-02-20 18:52:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:18,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {733#true} is VALID [2022-02-20 18:52:18,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {733#true} is VALID [2022-02-20 18:52:18,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume 0 == ~r1~0 % 256; {733#true} is VALID [2022-02-20 18:52:18,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {733#true} assume ~id1~0 >= 0; {733#true} is VALID [2022-02-20 18:52:18,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {733#true} assume 0 == ~st1~0; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} assume ~send1~0 == ~id1~0; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {733#true} assume 0 == ~mode1~0 % 256; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {733#true} assume ~id2~0 >= 0; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {733#true} assume 0 == ~st2~0; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} assume ~send2~0 == ~id2~0; {733#true} is VALID [2022-02-20 18:52:18,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume 0 == ~mode2~0 % 256; {733#true} is VALID [2022-02-20 18:52:18,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume ~id3~0 >= 0; {733#true} is VALID [2022-02-20 18:52:18,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {733#true} assume 0 == ~st3~0; {733#true} is VALID [2022-02-20 18:52:18,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {733#true} assume ~send3~0 == ~id3~0; {733#true} is VALID [2022-02-20 18:52:18,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {733#true} assume 0 == ~mode3~0 % 256; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {735#(= (+ (* (- 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; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {735#(= (+ (* (- 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; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {735#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:52:18,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {735#(= (+ (* (- 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; {734#false} is VALID [2022-02-20 18:52:18,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {734#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {734#false} is VALID [2022-02-20 18:52:18,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {734#false} ~mode3~0 := 0; {734#false} is VALID [2022-02-20 18:52:18,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {734#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {734#false} is VALID [2022-02-20 18:52:18,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {734#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {734#false} is VALID [2022-02-20 18:52:18,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {734#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {734#false} is VALID [2022-02-20 18:52:18,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {734#false} ~mode4~0 := 0; {734#false} is VALID [2022-02-20 18:52:18,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {734#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {734#false} is VALID [2022-02-20 18:52:18,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {734#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {734#false} is VALID [2022-02-20 18:52:18,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {734#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {734#false} is VALID [2022-02-20 18:52:18,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {734#false} assume 0 == main_~assert__arg~0#1 % 256; {734#false} is VALID [2022-02-20 18:52:18,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-02-20 18:52:18,324 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:18,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:18,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141180033] [2022-02-20 18:52:18,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141180033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:18,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:18,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:18,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359139161] [2022-02-20 18:52:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:52:18,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:18,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:18,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:18,370 INFO L87 Difference]: Start difference. First operand 120 states and 175 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,535 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2022-02-20 18:52:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:18,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:52:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 18:52:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 18:52:18,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 259 transitions. [2022-02-20 18:52:18,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,718 INFO L225 Difference]: With dead ends: 292 [2022-02-20 18:52:18,718 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 18:52:18,719 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:18,720 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 231 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:18,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 231 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:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 18:52:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-02-20 18:52:18,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:18,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,732 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,732 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,737 INFO L93 Difference]: Finished difference Result 198 states and 296 transitions. [2022-02-20 18:52:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2022-02-20 18:52:18,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:18,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:18,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 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 198 states. [2022-02-20 18:52:18,739 INFO L87 Difference]: Start difference. First operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 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 198 states. [2022-02-20 18:52:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,744 INFO L93 Difference]: Finished difference Result 198 states and 296 transitions. [2022-02-20 18:52:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2022-02-20 18:52:18,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:18,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:18,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:18,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 295 transitions. [2022-02-20 18:52:18,751 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 295 transitions. Word has length 49 [2022-02-20 18:52:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:18,752 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 295 transitions. [2022-02-20 18:52:18,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 295 transitions. [2022-02-20 18:52:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:52:18,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:18,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:18,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:18,753 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash -875864605, now seen corresponding path program 1 times [2022-02-20 18:52:18,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:18,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230489589] [2022-02-20 18:52:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:18,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {1795#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {1795#true} is VALID [2022-02-20 18:52:18,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1795#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1795#true} assume 0 == ~r1~0 % 256; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {1795#true} assume ~id1~0 >= 0; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {1795#true} assume 0 == ~st1~0; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#true} assume ~send1~0 == ~id1~0; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {1795#true} assume 0 == ~mode1~0 % 256; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#true} assume ~id2~0 >= 0; {1795#true} is VALID [2022-02-20 18:52:18,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#true} assume 0 == ~st2~0; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#true} assume ~send2~0 == ~id2~0; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1795#true} assume 0 == ~mode2~0 % 256; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1795#true} assume ~id3~0 >= 0; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1795#true} assume 0 == ~st3~0; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1795#true} assume ~send3~0 == ~id3~0; {1795#true} is VALID [2022-02-20 18:52:18,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {1795#true} assume 0 == ~mode3~0 % 256; {1795#true} is VALID [2022-02-20 18:52:18,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1795#true} assume ~id4~0 >= 0; {1795#true} is VALID [2022-02-20 18:52:18,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1795#true} assume 0 == ~st4~0; {1795#true} is VALID [2022-02-20 18:52:18,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1795#true} assume ~send4~0 == ~id4~0; {1795#true} is VALID [2022-02-20 18:52:18,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#true} assume 0 == ~mode4~0 % 256; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {1797#(= (+ (* (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; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {1797#(= (+ (* (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; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {1797#(= (+ (* (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; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1797#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {1797#(= (+ (* (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; {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {1796#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {1796#false} ~mode4~0 := 0; {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {1796#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {1796#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {1796#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {1796#false} is VALID [2022-02-20 18:52:18,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {1796#false} assume 0 == main_~assert__arg~0#1 % 256; {1796#false} is VALID [2022-02-20 18:52:18,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {1796#false} assume !false; {1796#false} is VALID [2022-02-20 18:52:18,816 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:18,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:18,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230489589] [2022-02-20 18:52:18,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230489589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:18,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:18,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:18,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99664420] [2022-02-20 18:52:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:18,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:52:18,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:18,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:18,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:18,851 INFO L87 Difference]: Start difference. First operand 196 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,002 INFO L93 Difference]: Finished difference Result 504 states and 781 transitions. [2022-02-20 18:52:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:52:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 18:52:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 18:52:19,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 259 transitions. [2022-02-20 18:52:19,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,182 INFO L225 Difference]: With dead ends: 504 [2022-02-20 18:52:19,183 INFO L226 Difference]: Without dead ends: 334 [2022-02-20 18:52:19,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:19,184 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-20 18:52:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2022-02-20 18:52:19,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:19,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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:19,203 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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:19,204 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,211 INFO L93 Difference]: Finished difference Result 334 states and 508 transitions. [2022-02-20 18:52:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 508 transitions. [2022-02-20 18:52:19,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 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 334 states. [2022-02-20 18:52:19,213 INFO L87 Difference]: Start difference. First operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 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 334 states. [2022-02-20 18:52:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,221 INFO L93 Difference]: Finished difference Result 334 states and 508 transitions. [2022-02-20 18:52:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 508 transitions. [2022-02-20 18:52:19,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:19,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2022-02-20 18:52:19,230 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 50 [2022-02-20 18:52:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:19,230 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2022-02-20 18:52:19,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2022-02-20 18:52:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:52:19,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:19,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:19,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:19,232 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1524907140, now seen corresponding path program 1 times [2022-02-20 18:52:19,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:19,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618039657] [2022-02-20 18:52:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:19,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {3620#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {3620#true} is VALID [2022-02-20 18:52:19,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {3620#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {3620#true} is VALID [2022-02-20 18:52:19,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {3620#true} assume 0 == ~r1~0 % 256; {3620#true} is VALID [2022-02-20 18:52:19,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {3620#true} assume ~id1~0 >= 0; {3620#true} is VALID [2022-02-20 18:52:19,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {3620#true} assume 0 == ~st1~0; {3622#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:19,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {3622#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3622#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:19,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {3622#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3622#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:19,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {3622#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3622#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:19,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {3622#(<= ~st1~0 0)} assume 0 == ~st2~0; {3623#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {3623#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3623#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {3623#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3623#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3623#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#(<= (+ ~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; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {3625#(<= (+ ~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; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0); {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {3625#(<= (+ ~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; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0); {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {3625#(<= (+ ~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; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:19,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {3625#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {3621#false} is VALID [2022-02-20 18:52:19,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {3621#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {3621#false} is VALID [2022-02-20 18:52:19,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {3621#false} assume 0 == main_~assert__arg~0#1 % 256; {3621#false} is VALID [2022-02-20 18:52:19,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {3621#false} assume !false; {3621#false} is VALID [2022-02-20 18:52:19,317 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:19,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:19,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618039657] [2022-02-20 18:52:19,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618039657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:19,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:19,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:19,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793114587] [2022-02-20 18:52:19,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:19,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:19,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:19,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:19,353 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:21,304 INFO L93 Difference]: Finished difference Result 2780 states and 4355 transitions. [2022-02-20 18:52:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:52:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2022-02-20 18:52:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2022-02-20 18:52:21,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 764 transitions. [2022-02-20 18:52:21,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,068 INFO L225 Difference]: With dead ends: 2780 [2022-02-20 18:52:22,068 INFO L226 Difference]: Without dead ends: 2474 [2022-02-20 18:52:22,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:22,070 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 697 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:22,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 1115 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2022-02-20 18:52:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 636. [2022-02-20 18:52:22,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:22,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2474 states. Second operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:22,456 INFO L74 IsIncluded]: Start isIncluded. First operand 2474 states. Second operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:22,457 INFO L87 Difference]: Start difference. First operand 2474 states. Second operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,618 INFO L93 Difference]: Finished difference Result 2474 states and 3810 transitions. [2022-02-20 18:52:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3810 transitions. [2022-02-20 18:52:22,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 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 2474 states. [2022-02-20 18:52:22,623 INFO L87 Difference]: Start difference. First operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 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 2474 states. [2022-02-20 18:52:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,786 INFO L93 Difference]: Finished difference Result 2474 states and 3810 transitions. [2022-02-20 18:52:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3810 transitions. [2022-02-20 18:52:22,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:22,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 971 transitions. [2022-02-20 18:52:22,806 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 971 transitions. Word has length 51 [2022-02-20 18:52:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:22,807 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 971 transitions. [2022-02-20 18:52:22,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 971 transitions. [2022-02-20 18:52:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:52:22,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:22,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:22,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:22,808 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash -48905761, now seen corresponding path program 1 times [2022-02-20 18:52:22,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:22,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017554982] [2022-02-20 18:52:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:22,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {13367#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {13367#true} is VALID [2022-02-20 18:52:22,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {13367#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {13367#true} is VALID [2022-02-20 18:52:22,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {13367#true} assume 0 == ~r1~0 % 256; {13367#true} is VALID [2022-02-20 18:52:22,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {13367#true} assume ~id1~0 >= 0; {13367#true} is VALID [2022-02-20 18:52:22,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {13367#true} assume 0 == ~st1~0; {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:22,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:22,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:22,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:22,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {13369#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:22,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:22,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:22,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:22,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {13370#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:22,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:22,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:22,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:22,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {13371#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:22,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0); {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0); {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0); {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:23,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {13372#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~0#1 := 0; {13368#false} is VALID [2022-02-20 18:52:23,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {13368#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {13368#false} is VALID [2022-02-20 18:52:23,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {13368#false} assume 0 == main_~assert__arg~0#1 % 256; {13368#false} is VALID [2022-02-20 18:52:23,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {13368#false} assume !false; {13368#false} is VALID [2022-02-20 18:52:23,011 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:23,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:23,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017554982] [2022-02-20 18:52:23,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017554982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:23,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:23,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:23,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631139007] [2022-02-20 18:52:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:52:23,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:23,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:23,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:23,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:23,050 INFO L87 Difference]: Start difference. First operand 636 states and 971 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,883 INFO L93 Difference]: Finished difference Result 1248 states and 1917 transitions. [2022-02-20 18:52:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:52:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2022-02-20 18:52:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2022-02-20 18:52:23,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 270 transitions. [2022-02-20 18:52:24,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:24,065 INFO L225 Difference]: With dead ends: 1248 [2022-02-20 18:52:24,066 INFO L226 Difference]: Without dead ends: 638 [2022-02-20 18:52:24,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:24,067 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 267 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:24,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 336 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-02-20 18:52:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2022-02-20 18:52:24,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:24,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call 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:24,573 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call 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:24,575 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call 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:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:24,591 INFO L93 Difference]: Finished difference Result 638 states and 964 transitions. [2022-02-20 18:52:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 964 transitions. [2022-02-20 18:52:24,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:24,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:24,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 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 638 states. [2022-02-20 18:52:24,594 INFO L87 Difference]: Start difference. First operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 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 638 states. [2022-02-20 18:52:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:24,609 INFO L93 Difference]: Finished difference Result 638 states and 964 transitions. [2022-02-20 18:52:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 964 transitions. [2022-02-20 18:52:24,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:24,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:24,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:24,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call 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:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 963 transitions. [2022-02-20 18:52:24,630 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 963 transitions. Word has length 53 [2022-02-20 18:52:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:24,630 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 963 transitions. [2022-02-20 18:52:24,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 963 transitions. [2022-02-20 18:52:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:52:24,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:24,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:24,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:24,633 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -69908416, now seen corresponding path program 1 times [2022-02-20 18:52:24,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:24,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658319052] [2022-02-20 18:52:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:24,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {17283#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {17283#true} is VALID [2022-02-20 18:52:24,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {17283#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {17283#true} is VALID [2022-02-20 18:52:24,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {17283#true} assume 0 == ~r1~0 % 256; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~nomsg~0); {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0); {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~nomsg~0); {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:52:24,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {17285#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {17284#false} is VALID [2022-02-20 18:52:24,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {17284#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {17284#false} is VALID [2022-02-20 18:52:24,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {17284#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {17284#false} is VALID [2022-02-20 18:52:24,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {17284#false} assume 0 == main_~assert__arg~0#1 % 256; {17284#false} is VALID [2022-02-20 18:52:24,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {17284#false} assume !false; {17284#false} is VALID [2022-02-20 18:52:24,734 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:24,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:24,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658319052] [2022-02-20 18:52:24,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658319052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:24,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:24,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:24,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183493777] [2022-02-20 18:52:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:24,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:52:24,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:24,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:24,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:24,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:24,769 INFO L87 Difference]: Start difference. First operand 636 states and 963 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,921 INFO L93 Difference]: Finished difference Result 1768 states and 2685 transitions. [2022-02-20 18:52:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:52:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-02-20 18:52:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-02-20 18:52:25,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 263 transitions. [2022-02-20 18:52:26,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,133 INFO L225 Difference]: With dead ends: 1768 [2022-02-20 18:52:26,133 INFO L226 Difference]: Without dead ends: 1158 [2022-02-20 18:52:26,134 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:26,136 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:26,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 181 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-02-20 18:52:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1140. [2022-02-20 18:52:26,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1158 states. Second operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:26,982 INFO L74 IsIncluded]: Start isIncluded. First operand 1158 states. Second operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:26,983 INFO L87 Difference]: Start difference. First operand 1158 states. Second operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,041 INFO L93 Difference]: Finished difference Result 1158 states and 1708 transitions. [2022-02-20 18:52:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1708 transitions. [2022-02-20 18:52:27,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 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 1158 states. [2022-02-20 18:52:27,046 INFO L87 Difference]: Start difference. First operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 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 1158 states. [2022-02-20 18:52:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,083 INFO L93 Difference]: Finished difference Result 1158 states and 1708 transitions. [2022-02-20 18:52:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1708 transitions. [2022-02-20 18:52:27,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:27,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1691 transitions. [2022-02-20 18:52:27,132 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1691 transitions. Word has length 53 [2022-02-20 18:52:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:27,132 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 1691 transitions. [2022-02-20 18:52:27,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1691 transitions. [2022-02-20 18:52:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:27,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:27,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:27,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:27,133 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1517987980, now seen corresponding path program 1 times [2022-02-20 18:52:27,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:27,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451557248] [2022-02-20 18:52:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:27,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {23688#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {23690#(<= (+ ~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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {23690#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {23690#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {23691#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:27,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {23691#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {23691#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:27,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {23691#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~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; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0); {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~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; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0); {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~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; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {23692#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:27,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {23692#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0); {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {23689#false} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {23689#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; {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {23689#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {23689#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {23689#false} assume !(~r1~0 % 256 >= 4); {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {23689#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {23689#false} is VALID [2022-02-20 18:52:27,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {23689#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {23689#false} is VALID [2022-02-20 18:52:27,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {23689#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {23689#false} is VALID [2022-02-20 18:52:27,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {23689#false} assume 0 == main_~assert__arg~0#1 % 256; {23689#false} is VALID [2022-02-20 18:52:27,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {23689#false} assume !false; {23689#false} is VALID [2022-02-20 18:52:27,220 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:27,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:27,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451557248] [2022-02-20 18:52:27,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451557248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:27,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:27,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:27,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992734516] [2022-02-20 18:52:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:27,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:27,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:27,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:27,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:27,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:27,252 INFO L87 Difference]: Start difference. First operand 1140 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,024 INFO L93 Difference]: Finished difference Result 2254 states and 3356 transitions. [2022-02-20 18:52:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2022-02-20 18:52:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2022-02-20 18:52:29,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 190 transitions. [2022-02-20 18:52:29,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:29,235 INFO L225 Difference]: With dead ends: 2254 [2022-02-20 18:52:29,235 INFO L226 Difference]: Without dead ends: 1140 [2022-02-20 18:52:29,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:29,239 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 243 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:29,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 94 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-02-20 18:52:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-02-20 18:52:30,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:30,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call 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:30,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call 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:30,328 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call 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:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,364 INFO L93 Difference]: Finished difference Result 1140 states and 1675 transitions. [2022-02-20 18:52:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1675 transitions. [2022-02-20 18:52:30,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:30,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:30,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:30,368 INFO L87 Difference]: Start difference. First operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,408 INFO L93 Difference]: Finished difference Result 1140 states and 1675 transitions. [2022-02-20 18:52:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1675 transitions. [2022-02-20 18:52:30,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:30,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:30,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:30,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call 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:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1675 transitions. [2022-02-20 18:52:30,465 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1675 transitions. Word has length 54 [2022-02-20 18:52:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:30,467 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 1675 transitions. [2022-02-20 18:52:30,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1675 transitions. [2022-02-20 18:52:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:30,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:30,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:30,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:30,469 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2047278481, now seen corresponding path program 1 times [2022-02-20 18:52:30,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:30,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582201633] [2022-02-20 18:52:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:30,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {30741#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {30743#(<= (+ ~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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {30743#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {30743#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {30744#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:30,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {30744#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {30744#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:30,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {30744#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {30745#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:30,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {30745#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {30742#false} is VALID [2022-02-20 18:52:30,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {30742#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {30742#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; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {30742#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {30742#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {30742#false} assume !(~send3~0 != ~nomsg~0); {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {30742#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {30742#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; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {30742#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {30742#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {30742#false} is VALID [2022-02-20 18:52:30,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {30742#false} assume ~send4~0 != ~nomsg~0; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {30742#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {30742#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; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {30742#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {30742#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {30742#false} assume !(~r1~0 % 256 >= 4); {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {30742#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {30742#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {30742#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {30742#false} is VALID [2022-02-20 18:52:30,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {30742#false} assume 0 == main_~assert__arg~0#1 % 256; {30742#false} is VALID [2022-02-20 18:52:30,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {30742#false} assume !false; {30742#false} is VALID [2022-02-20 18:52:30,554 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:30,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:30,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582201633] [2022-02-20 18:52:30,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582201633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:30,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:30,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:30,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753404204] [2022-02-20 18:52:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:30,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:30,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:30,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:30,584 INFO L87 Difference]: Start difference. First operand 1140 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:32,643 INFO L93 Difference]: Finished difference Result 2254 states and 3324 transitions. [2022-02-20 18:52:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2022-02-20 18:52:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2022-02-20 18:52:32,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 188 transitions. [2022-02-20 18:52:32,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:32,791 INFO L225 Difference]: With dead ends: 2254 [2022-02-20 18:52:32,792 INFO L226 Difference]: Without dead ends: 1140 [2022-02-20 18:52:32,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:32,793 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 266 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:32,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 78 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-02-20 18:52:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-02-20 18:52:34,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:34,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call 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:34,581 INFO L74 IsIncluded]: Start isIncluded. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call 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:34,582 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call 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:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,616 INFO L93 Difference]: Finished difference Result 1140 states and 1659 transitions. [2022-02-20 18:52:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1659 transitions. [2022-02-20 18:52:34,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:34,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:34,619 INFO L87 Difference]: Start difference. First operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,654 INFO L93 Difference]: Finished difference Result 1140 states and 1659 transitions. [2022-02-20 18:52:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1659 transitions. [2022-02-20 18:52:34,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:34,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:34,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:34,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call 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:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1659 transitions. [2022-02-20 18:52:34,702 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1659 transitions. Word has length 54 [2022-02-20 18:52:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:34,702 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 1659 transitions. [2022-02-20 18:52:34,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1659 transitions. [2022-02-20 18:52:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:34,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:34,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:34,704 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1919193174, now seen corresponding path program 1 times [2022-02-20 18:52:34,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:34,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407220560] [2022-02-20 18:52:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:34,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {37794#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {37796#(<= (+ ~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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {37796#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:34,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {37796#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {37797#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:34,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {37797#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {37797#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:34,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {37797#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37798#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:34,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {37798#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0); {37795#false} is VALID [2022-02-20 18:52:34,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {37795#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {37795#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; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {37795#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {37795#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {37795#false} assume ~send4~0 != ~nomsg~0; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {37795#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {37795#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; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {37795#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {37795#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {37795#false} is VALID [2022-02-20 18:52:34,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {37795#false} assume !(~r1~0 % 256 >= 4); {37795#false} is VALID [2022-02-20 18:52:34,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {37795#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {37795#false} is VALID [2022-02-20 18:52:34,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {37795#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {37795#false} is VALID [2022-02-20 18:52:34,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {37795#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {37795#false} is VALID [2022-02-20 18:52:34,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {37795#false} assume 0 == main_~assert__arg~0#1 % 256; {37795#false} is VALID [2022-02-20 18:52:34,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {37795#false} assume !false; {37795#false} is VALID [2022-02-20 18:52:34,757 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:34,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:34,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407220560] [2022-02-20 18:52:34,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407220560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:34,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:34,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:34,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078013455] [2022-02-20 18:52:34,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:34,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:34,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:34,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:34,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:34,788 INFO L87 Difference]: Start difference. First operand 1140 states and 1659 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,967 INFO L93 Difference]: Finished difference Result 2254 states and 3292 transitions. [2022-02-20 18:52:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2022-02-20 18:52:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2022-02-20 18:52:36,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 186 transitions. [2022-02-20 18:52:37,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:37,102 INFO L225 Difference]: With dead ends: 2254 [2022-02-20 18:52:37,103 INFO L226 Difference]: Without dead ends: 1140 [2022-02-20 18:52:37,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:37,104 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 250 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:37,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 86 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-02-20 18:52:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-02-20 18:52:39,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:39,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call 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:39,474 INFO L74 IsIncluded]: Start isIncluded. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call 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:39,475 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call 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:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,510 INFO L93 Difference]: Finished difference Result 1140 states and 1643 transitions. [2022-02-20 18:52:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1643 transitions. [2022-02-20 18:52:39,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:39,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:39,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:39,513 INFO L87 Difference]: Start difference. First operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 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 1140 states. [2022-02-20 18:52:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,547 INFO L93 Difference]: Finished difference Result 1140 states and 1643 transitions. [2022-02-20 18:52:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1643 transitions. [2022-02-20 18:52:39,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:39,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:39,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:39,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call 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:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1643 transitions. [2022-02-20 18:52:39,596 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1643 transitions. Word has length 54 [2022-02-20 18:52:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:39,597 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 1643 transitions. [2022-02-20 18:52:39,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1643 transitions. [2022-02-20 18:52:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:39,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:39,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:39,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:39,598 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1053660785, now seen corresponding path program 1 times [2022-02-20 18:52:39,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:39,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450413245] [2022-02-20 18:52:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:39,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {44847#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {44847#true} is VALID [2022-02-20 18:52:39,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {44847#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {44847#true} assume 0 == ~r1~0 % 256; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {44847#true} assume ~id1~0 >= 0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {44847#true} assume 0 == ~st1~0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {44847#true} assume ~send1~0 == ~id1~0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {44847#true} assume 0 == ~mode1~0 % 256; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {44847#true} assume ~id2~0 >= 0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {44847#true} assume 0 == ~st2~0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {44847#true} assume ~send2~0 == ~id2~0; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {44847#true} assume 0 == ~mode2~0 % 256; {44847#true} is VALID [2022-02-20 18:52:39,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {44847#true} assume ~id3~0 >= 0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {44847#true} assume 0 == ~st3~0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {44847#true} assume ~send3~0 == ~id3~0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {44847#true} assume 0 == ~mode3~0 % 256; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {44847#true} assume ~id4~0 >= 0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {44847#true} assume 0 == ~st4~0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {44847#true} assume ~send4~0 == ~id4~0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {44847#true} assume 0 == ~mode4~0 % 256; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {44847#true} assume ~id1~0 != ~id2~0; {44847#true} is VALID [2022-02-20 18:52:39,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {44847#true} assume ~id1~0 != ~id3~0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {44847#true} assume ~id1~0 != ~id4~0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {44847#true} assume ~id2~0 != ~id3~0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {44847#true} assume ~id2~0 != ~id4~0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {44847#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {44849#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {44849#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {44847#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {44847#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {44847#true} is VALID [2022-02-20 18:52:39,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {44847#true} assume ~send1~0 != ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {44847#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {44847#true} is VALID [2022-02-20 18:52:39,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {44847#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {44847#true} is VALID [2022-02-20 18:52:39,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {44847#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {44847#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {44847#true} is VALID [2022-02-20 18:52:39,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {44847#true} assume ~send2~0 != ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {44847#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {44847#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {44847#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {44847#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {44847#true} assume ~send3~0 != ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {44847#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {44847#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {44847#true} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {44847#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {44847#true} is VALID [2022-02-20 18:52:39,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {44847#true} assume ~send4~0 != ~nomsg~0; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {44847#true} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {44847#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {44847#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {44847#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {44847#true} assume !(~r1~0 % 256 >= 4); {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {44847#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {44847#true} is VALID [2022-02-20 18:52:39,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {44847#true} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {44850#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:52:39,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {44850#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {44851#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:52:39,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {44851#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {44848#false} is VALID [2022-02-20 18:52:39,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {44848#false} assume !false; {44848#false} is VALID [2022-02-20 18:52:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:39,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:39,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450413245] [2022-02-20 18:52:39,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450413245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:39,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:39,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:52:39,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847633002] [2022-02-20 18:52:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:39,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:39,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:39,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:39,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:39,703 INFO L87 Difference]: Start difference. First operand 1140 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,224 INFO L93 Difference]: Finished difference Result 1929 states and 2780 transitions. [2022-02-20 18:52:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:44,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-02-20 18:52:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-02-20 18:52:44,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 186 transitions. [2022-02-20 18:52:44,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,500 INFO L225 Difference]: With dead ends: 1929 [2022-02-20 18:52:44,500 INFO L226 Difference]: Without dead ends: 1927 [2022-02-20 18:52:44,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:44,501 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 142 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:44,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 507 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-02-20 18:52:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1172. [2022-02-20 18:52:46,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:46,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1927 states. Second operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call 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,303 INFO L74 IsIncluded]: Start isIncluded. First operand 1927 states. Second operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call 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,304 INFO L87 Difference]: Start difference. First operand 1927 states. Second operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call 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,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,403 INFO L93 Difference]: Finished difference Result 1927 states and 2755 transitions. [2022-02-20 18:52:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2755 transitions. [2022-02-20 18:52:46,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:46,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:46,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 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 1927 states. [2022-02-20 18:52:46,406 INFO L87 Difference]: Start difference. First operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 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 1927 states. [2022-02-20 18:52:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,500 INFO L93 Difference]: Finished difference Result 1927 states and 2755 transitions. [2022-02-20 18:52:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2755 transitions. [2022-02-20 18:52:46,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:46,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:46,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:46,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call 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,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1667 transitions. [2022-02-20 18:52:46,549 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1667 transitions. Word has length 54 [2022-02-20 18:52:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:46,550 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 1667 transitions. [2022-02-20 18:52:46,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1667 transitions. [2022-02-20 18:52:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:46,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:46,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:46,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:46,551 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1226019551, now seen corresponding path program 1 times [2022-02-20 18:52:46,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:46,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398637498] [2022-02-20 18:52:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:46,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {53095#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {53095#true} is VALID [2022-02-20 18:52:46,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {53095#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {53095#true} is VALID [2022-02-20 18:52:46,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {53095#true} assume 0 == ~r1~0 % 256; {53095#true} is VALID [2022-02-20 18:52:46,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {53095#true} assume ~id1~0 >= 0; {53095#true} is VALID [2022-02-20 18:52:46,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {53095#true} assume 0 == ~st1~0; {53095#true} is VALID [2022-02-20 18:52:46,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {53095#true} assume ~send1~0 == ~id1~0; {53095#true} is VALID [2022-02-20 18:52:46,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {53095#true} assume 0 == ~mode1~0 % 256; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:52:46,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {53097#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {53096#false} is VALID [2022-02-20 18:52:46,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {53096#false} assume !(255 == ~r1~0 % 256); {53096#false} is VALID [2022-02-20 18:52:46,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {53096#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {53096#false} assume main_~node1__m1~0#1 != ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {53096#false} assume !(main_~node1__m1~0#1 > ~id1~0); {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {53096#false} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {53096#false} ~mode1~0 := 0; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {53096#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {53096#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {53096#false} assume ~send2~0 != ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {53096#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {53096#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; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {53096#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {53096#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {53096#false} is VALID [2022-02-20 18:52:46,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {53096#false} assume ~send3~0 != ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {53096#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {53096#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; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {53096#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {53096#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {53096#false} assume ~send4~0 != ~nomsg~0; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {53096#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {53096#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; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {53096#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {53096#false} is VALID [2022-02-20 18:52:46,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {53096#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {53096#false} is VALID [2022-02-20 18:52:46,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {53096#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {53096#false} is VALID [2022-02-20 18:52:46,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {53096#false} assume 0 == main_~assert__arg~0#1 % 256; {53096#false} is VALID [2022-02-20 18:52:46,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {53096#false} assume !false; {53096#false} is VALID [2022-02-20 18:52:46,587 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,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:46,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398637498] [2022-02-20 18:52:46,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398637498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:46,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:46,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:46,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205121773] [2022-02-20 18:52:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:46,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:46,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:46,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:46,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:46,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:46,627 INFO L87 Difference]: Start difference. First operand 1172 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,728 INFO L93 Difference]: Finished difference Result 2299 states and 3305 transitions. [2022-02-20 18:52:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:52:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2022-02-20 18:52:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2022-02-20 18:52:49,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 247 transitions. [2022-02-20 18:52:49,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:49,942 INFO L225 Difference]: With dead ends: 2299 [2022-02-20 18:52:49,942 INFO L226 Difference]: Without dead ends: 1656 [2022-02-20 18:52:49,943 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,943 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 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,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 234 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,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-02-20 18:52:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1654. [2022-02-20 18:52:52,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:52,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1656 states. Second operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call 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:52,621 INFO L74 IsIncluded]: Start isIncluded. First operand 1656 states. Second operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call 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:52,623 INFO L87 Difference]: Start difference. First operand 1656 states. Second operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call 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:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,700 INFO L93 Difference]: Finished difference Result 1656 states and 2342 transitions. [2022-02-20 18:52:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2342 transitions. [2022-02-20 18:52:52,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 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 1656 states. [2022-02-20 18:52:52,705 INFO L87 Difference]: Start difference. First operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 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 1656 states. [2022-02-20 18:52:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,788 INFO L93 Difference]: Finished difference Result 1656 states and 2342 transitions. [2022-02-20 18:52:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2342 transitions. [2022-02-20 18:52:52,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:52,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call 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:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2341 transitions. [2022-02-20 18:52:52,896 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2341 transitions. Word has length 54 [2022-02-20 18:52:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:52,897 INFO L470 AbstractCegarLoop]: Abstraction has 1654 states and 2341 transitions. [2022-02-20 18:52:52,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2341 transitions. [2022-02-20 18:52:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:52:52,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:52,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:52,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:52,898 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:52,899 INFO L85 PathProgramCache]: Analyzing trace with hash 595199301, now seen corresponding path program 1 times [2022-02-20 18:52:52,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:52,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844654377] [2022-02-20 18:52:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:53,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {61975#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {61975#true} is VALID [2022-02-20 18:52:53,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {61975#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {61975#true} is VALID [2022-02-20 18:52:53,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {61975#true} assume 0 == ~r1~0 % 256; {61975#true} is VALID [2022-02-20 18:52:53,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {61975#true} assume ~id1~0 >= 0; {61975#true} is VALID [2022-02-20 18:52:53,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {61975#true} assume 0 == ~st1~0; {61977#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:53,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {61977#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {61977#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:53,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {61977#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {61977#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:53,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {61977#(<= ~st1~0 0)} assume ~id2~0 >= 0; {61977#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:53,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {61977#(<= ~st1~0 0)} assume 0 == ~st2~0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {61978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {61978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {61979#(<= (+ ~st4~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {61979#(<= (+ ~st4~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {61979#(<= (+ ~st4~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {61979#(<= (+ ~st4~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {61979#(<= (+ ~st4~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; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 != ~nomsg~0; {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 > ~id3~0); {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:53,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {61979#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,029 INFO L290 TraceCheckUtils]: 67: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,030 INFO L290 TraceCheckUtils]: 70: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~0#1 != ~nomsg~0); {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,031 INFO L290 TraceCheckUtils]: 72: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:53,031 INFO L290 TraceCheckUtils]: 73: Hoare triple {61980#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {61976#false} is VALID [2022-02-20 18:52:53,031 INFO L290 TraceCheckUtils]: 74: Hoare triple {61976#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {61976#false} is VALID [2022-02-20 18:52:53,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {61976#false} assume 0 == main_~assert__arg~0#1 % 256; {61976#false} is VALID [2022-02-20 18:52:53,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {61976#false} assume !false; {61976#false} is VALID [2022-02-20 18:52:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 18:52:53,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:53,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844654377] [2022-02-20 18:52:53,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844654377] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:53,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:53,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:53,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039855724] [2022-02-20 18:52:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:53,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2022-02-20 18:52:53,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:53,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:53,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:53,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:53,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:53,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:53,104 INFO L87 Difference]: Start difference. First operand 1654 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:09,978 INFO L93 Difference]: Finished difference Result 8472 states and 12022 transitions. [2022-02-20 18:53:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:53:09,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2022-02-20 18:53:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2022-02-20 18:53:09,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 497 transitions. [2022-02-20 18:53:10,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 497 edges. 497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:12,183 INFO L225 Difference]: With dead ends: 8472 [2022-02-20 18:53:12,183 INFO L226 Difference]: Without dead ends: 6846 [2022-02-20 18:53:12,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:12,195 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 486 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:12,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 563 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6846 states. [2022-02-20 18:53:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6846 to 3278. [2022-02-20 18:53:19,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:19,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6846 states. Second operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call 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:19,488 INFO L74 IsIncluded]: Start isIncluded. First operand 6846 states. Second operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call 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:19,490 INFO L87 Difference]: Start difference. First operand 6846 states. Second operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call 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,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,846 INFO L93 Difference]: Finished difference Result 6846 states and 9685 transitions. [2022-02-20 18:53:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6846 states and 9685 transitions. [2022-02-20 18:53:20,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 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 6846 states. [2022-02-20 18:53:20,859 INFO L87 Difference]: Start difference. First operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 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 6846 states. [2022-02-20 18:53:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:22,187 INFO L93 Difference]: Finished difference Result 6846 states and 9685 transitions. [2022-02-20 18:53:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6846 states and 9685 transitions. [2022-02-20 18:53:22,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:22,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:22,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:22,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call 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:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4629 transitions. [2022-02-20 18:53:22,644 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4629 transitions. Word has length 77 [2022-02-20 18:53:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:22,644 INFO L470 AbstractCegarLoop]: Abstraction has 3278 states and 4629 transitions. [2022-02-20 18:53:22,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4629 transitions. [2022-02-20 18:53:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:22,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:22,646 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:22,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:53:22,646 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -558746805, now seen corresponding path program 1 times [2022-02-20 18:53:22,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:22,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715313750] [2022-02-20 18:53:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:22,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {92270#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2990~0 := 0; {92270#true} is VALID [2022-02-20 18:53:22,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {92270#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {92270#true} is VALID [2022-02-20 18:53:22,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {92270#true} assume 0 == ~r1~0 % 256; {92270#true} is VALID [2022-02-20 18:53:22,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {92270#true} assume ~id1~0 >= 0; {92270#true} is VALID [2022-02-20 18:53:22,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {92270#true} assume 0 == ~st1~0; {92272#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {92272#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {92272#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {92272#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {92272#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {92272#(<= ~st1~0 0)} assume ~id2~0 >= 0; {92272#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {92272#(<= ~st1~0 0)} assume 0 == ~st2~0; {92273#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {92273#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {92273#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {92273#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {92273#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {92273#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {92273#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {92273#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {92274#(<= (+ ~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {92274#(<= (+ ~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {92274#(<= (+ ~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {92274#(<= (+ ~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {92274#(<= (+ ~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; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~0#1 != ~nomsg~0; {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~0#1 > ~id4~0); {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {92274#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~0#1 == ~id4~0;~st4~0 := 1; {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,801 INFO L290 TraceCheckUtils]: 71: Hoare triple {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0; {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,802 INFO L290 TraceCheckUtils]: 73: Hoare triple {92275#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {92271#false} is VALID [2022-02-20 18:53:22,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {92271#false} ~__return_2990~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2990~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; {92271#false} is VALID [2022-02-20 18:53:22,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {92271#false} assume 0 == main_~assert__arg~0#1 % 256; {92271#false} is VALID [2022-02-20 18:53:22,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {92271#false} assume !false; {92271#false} is VALID [2022-02-20 18:53:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 18:53:22,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:22,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715313750] [2022-02-20 18:53:22,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715313750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:22,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:22,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:53:22,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727611510] [2022-02-20 18:53:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:22,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:22,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call 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:22,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:22,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:53:22,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:53:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:53:22,857 INFO L87 Difference]: Start difference. First operand 3278 states and 4629 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)