./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.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-var-start-time.5.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 8d970a6b46f522cdb24394c622109e56254d5436a464b2c277d963fe4612a422 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:48:43,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:48:43,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:48:43,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:48:43,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:48:43,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:48:43,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:48:43,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:48:43,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:48:43,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:48:43,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:48:43,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:48:43,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:48:43,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:48:43,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:48:43,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:48:43,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:48:43,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:48:43,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:48:43,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:48:43,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:48:43,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:48:43,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:48:43,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:48:43,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:48:43,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:48:43,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:48:43,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:48:43,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:48:43,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:48:43,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:48:43,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:48:43,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:48:43,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:48:43,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:48:43,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:48:43,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:48:43,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:48:43,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:48:43,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:48:43,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:48:43,545 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:48:43,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:48:43,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:48:43,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:48:43,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:48:43,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:48:43,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:48:43,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:48:43,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:48:43,585 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:48:43,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:48:43,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:48:43,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:48:43,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:48:43,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:48:43,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:48:43,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:48:43,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:48:43,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:48:43,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:48:43,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:48:43,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:48:43,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:48:43,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:48:43,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:48:43,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:43,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:48:43,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:48:43,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:48:43,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:48:43,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:48:43,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:48:43,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:48:43,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:48:43,592 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 -> 8d970a6b46f522cdb24394c622109e56254d5436a464b2c277d963fe4612a422 [2022-02-20 18:48:43,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:48:43,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:48:43,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:48:43,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:48:43,842 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:48:43,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:43,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6db9000/32f5c065f2b741db8c90e6aec2384434/FLAG24d9349bf [2022-02-20 18:48:44,347 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:48:44,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:44,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6db9000/32f5c065f2b741db8c90e6aec2384434/FLAG24d9349bf [2022-02-20 18:48:44,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6db9000/32f5c065f2b741db8c90e6aec2384434 [2022-02-20 18:48:44,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:48:44,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:48:44,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:44,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:48:44,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:48:44,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:44" (1/1) ... [2022-02-20 18:48:44,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b84272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:44, skipping insertion in model container [2022-02-20 18:48:44,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:44" (1/1) ... [2022-02-20 18:48:44,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:48:44,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:48:45,100 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6356,6369] [2022-02-20 18:48:45,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:45,144 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:48:45,202 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6356,6369] [2022-02-20 18:48:45,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:45,241 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:48:45,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45 WrapperNode [2022-02-20 18:48:45,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:45,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:45,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:48:45,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:48:45,251 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:48:45" (1/1) ... [2022-02-20 18:48:45,270 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:48:45" (1/1) ... [2022-02-20 18:48:45,328 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 519 [2022-02-20 18:48:45,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:45,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:48:45,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:48:45,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:48:45,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:48:45,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:48:45,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:48:45,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:48:45,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (1/1) ... [2022-02-20 18:48:45,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:48:45,421 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:48:45,422 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:48:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:48:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:48:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:48:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:48:45,605 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:48:45,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:48:46,261 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:48:46,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:48:46,273 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:48:46,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:46 BoogieIcfgContainer [2022-02-20 18:48:46,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:48:46,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:48:46,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:48:46,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:48:46,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:48:44" (1/3) ... [2022-02-20 18:48:46,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66066490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:46, skipping insertion in model container [2022-02-20 18:48:46,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:45" (2/3) ... [2022-02-20 18:48:46,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66066490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:46, skipping insertion in model container [2022-02-20 18:48:46,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:46" (3/3) ... [2022-02-20 18:48:46,286 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:46,291 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:48:46,291 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:48:46,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:48:46,361 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:48:46,361 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:48:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 137 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:48:46,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:46,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:46,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1025697732, now seen corresponding path program 1 times [2022-02-20 18:48:46,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:46,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751307203] [2022-02-20 18:48:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:46,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {141#true} is VALID [2022-02-20 18:48:46,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {141#true} is VALID [2022-02-20 18:48:46,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume 0 == ~r1~0 % 256; {141#true} is VALID [2022-02-20 18:48:46,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {141#true} is VALID [2022-02-20 18:48:46,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#true} assume ~id1~0 >= 0; {141#true} is VALID [2022-02-20 18:48:46,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} assume 0 == ~st1~0; {141#true} is VALID [2022-02-20 18:48:46,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#true} assume ~send1~0 == ~id1~0; {141#true} is VALID [2022-02-20 18:48:46,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} assume 0 == ~mode1~0 % 256; {141#true} is VALID [2022-02-20 18:48:46,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#true} assume ~id2~0 >= 0; {141#true} is VALID [2022-02-20 18:48:46,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#true} assume 0 == ~st2~0; {141#true} is VALID [2022-02-20 18:48:46,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#true} assume ~send2~0 == ~id2~0; {141#true} is VALID [2022-02-20 18:48:46,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#true} assume 0 == ~mode2~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:46,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {143#(= (+ (* (- 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; {142#false} is VALID [2022-02-20 18:48:46,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {142#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:48:46,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {142#false} ~mode2~0 := 0; {142#false} is VALID [2022-02-20 18:48:46,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {142#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {142#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {142#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:48:46,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {142#false} ~mode3~0 := 0; {142#false} is VALID [2022-02-20 18:48:46,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {142#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {142#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {142#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:48:46,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {142#false} ~mode4~0 := 0; {142#false} is VALID [2022-02-20 18:48:46,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {142#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {142#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:48:46,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {142#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:48:46,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {142#false} ~mode5~0 := 0; {142#false} is VALID [2022-02-20 18:48:46,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {142#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {142#false} is VALID [2022-02-20 18:48:46,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {142#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {142#false} is VALID [2022-02-20 18:48:46,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {142#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {142#false} is VALID [2022-02-20 18:48:46,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {142#false} assume 0 == main_~assert__arg~0#1 % 256; {142#false} is VALID [2022-02-20 18:48:46,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-02-20 18:48:46,772 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:48:46,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:46,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751307203] [2022-02-20 18:48:46,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751307203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:46,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:46,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:46,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962998625] [2022-02-20 18:48:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:48:46,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:46,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:46,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:46,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:46,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:46,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:46,912 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 137 states have internal predecessors, (230), 0 states have call successors, (0), 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 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:47,394 INFO L93 Difference]: Finished difference Result 328 states and 528 transitions. [2022-02-20 18:48:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:48:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-02-20 18:48:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-02-20 18:48:47,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 528 transitions. [2022-02-20 18:48:47,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:47,900 INFO L225 Difference]: With dead ends: 328 [2022-02-20 18:48:47,900 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 18:48:47,903 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:48:47,906 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 167 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 487 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:48:47,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 487 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 18:48:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-02-20 18:48:47,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:47,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,989 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,990 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:47,999 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2022-02-20 18:48:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2022-02-20 18:48:48,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:48,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:48,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 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 219 states. [2022-02-20 18:48:48,003 INFO L87 Difference]: Start difference. First operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 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 219 states. [2022-02-20 18:48:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:48,011 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2022-02-20 18:48:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2022-02-20 18:48:48,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:48,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:48,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:48,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2022-02-20 18:48:48,024 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 61 [2022-02-20 18:48:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:48,025 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2022-02-20 18:48:48,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2022-02-20 18:48:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:48:48,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:48,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:48,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:48:48,028 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:48,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1571099909, now seen corresponding path program 1 times [2022-02-20 18:48:48,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:48,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017506271] [2022-02-20 18:48:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:48,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {1310#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {1310#true} is VALID [2022-02-20 18:48:48,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {1310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {1310#true} is VALID [2022-02-20 18:48:48,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#true} assume 0 == ~r1~0 % 256; {1310#true} is VALID [2022-02-20 18:48:48,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {1310#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1310#true} is VALID [2022-02-20 18:48:48,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {1310#true} assume ~id1~0 >= 0; {1310#true} is VALID [2022-02-20 18:48:48,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#true} assume 0 == ~st1~0; {1310#true} is VALID [2022-02-20 18:48:48,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {1310#true} assume ~send1~0 == ~id1~0; {1310#true} is VALID [2022-02-20 18:48:48,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#true} assume 0 == ~mode1~0 % 256; {1310#true} is VALID [2022-02-20 18:48:48,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#true} assume ~id2~0 >= 0; {1310#true} is VALID [2022-02-20 18:48:48,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#true} assume 0 == ~st2~0; {1310#true} is VALID [2022-02-20 18:48:48,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#true} assume ~send2~0 == ~id2~0; {1310#true} is VALID [2022-02-20 18:48:48,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {1310#true} assume 0 == ~mode2~0 % 256; {1310#true} is VALID [2022-02-20 18:48:48,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#true} assume ~id3~0 >= 0; {1310#true} is VALID [2022-02-20 18:48:48,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#true} assume 0 == ~st3~0; {1310#true} is VALID [2022-02-20 18:48:48,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#true} assume ~send3~0 == ~id3~0; {1310#true} is VALID [2022-02-20 18:48:48,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1310#true} assume 0 == ~mode3~0 % 256; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1312#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:48,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {1312#(= (+ (* (- 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; {1311#false} is VALID [2022-02-20 18:48:48,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {1311#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1311#false} is VALID [2022-02-20 18:48:48,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {1311#false} ~mode3~0 := 0; {1311#false} is VALID [2022-02-20 18:48:48,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {1311#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1311#false} is VALID [2022-02-20 18:48:48,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {1311#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1311#false} is VALID [2022-02-20 18:48:48,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {1311#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1311#false} is VALID [2022-02-20 18:48:48,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {1311#false} ~mode4~0 := 0; {1311#false} is VALID [2022-02-20 18:48:48,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {1311#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1311#false} is VALID [2022-02-20 18:48:48,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {1311#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1311#false} is VALID [2022-02-20 18:48:48,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {1311#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1311#false} is VALID [2022-02-20 18:48:48,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {1311#false} ~mode5~0 := 0; {1311#false} is VALID [2022-02-20 18:48:48,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {1311#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1311#false} is VALID [2022-02-20 18:48:48,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {1311#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {1311#false} is VALID [2022-02-20 18:48:48,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {1311#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {1311#false} is VALID [2022-02-20 18:48:48,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {1311#false} assume 0 == main_~assert__arg~0#1 % 256; {1311#false} is VALID [2022-02-20 18:48:48,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2022-02-20 18:48:48,185 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:48:48,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:48,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017506271] [2022-02-20 18:48:48,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017506271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:48,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:48,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:48,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381837349] [2022-02-20 18:48:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:48:48,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:48,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:48,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:48,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:48,237 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:48,570 INFO L93 Difference]: Finished difference Result 549 states and 853 transitions. [2022-02-20 18:48:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:48:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:48,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions. [2022-02-20 18:48:48,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:48,980 INFO L225 Difference]: With dead ends: 549 [2022-02-20 18:48:48,980 INFO L226 Difference]: Without dead ends: 367 [2022-02-20 18:48:48,981 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:48:48,982 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 137 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 424 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:48:48,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-02-20 18:48:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2022-02-20 18:48:49,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:49,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,009 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,010 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:49,023 INFO L93 Difference]: Finished difference Result 367 states and 561 transitions. [2022-02-20 18:48:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2022-02-20 18:48:49,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:49,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:49,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 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 367 states. [2022-02-20 18:48:49,026 INFO L87 Difference]: Start difference. First operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 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 367 states. [2022-02-20 18:48:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:49,038 INFO L93 Difference]: Finished difference Result 367 states and 561 transitions. [2022-02-20 18:48:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2022-02-20 18:48:49,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:49,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:49,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:49,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 560 transitions. [2022-02-20 18:48:49,054 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 560 transitions. Word has length 62 [2022-02-20 18:48:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:49,054 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 560 transitions. [2022-02-20 18:48:49,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 560 transitions. [2022-02-20 18:48:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:48:49,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:49,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:49,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:48:49,056 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash 195770199, now seen corresponding path program 1 times [2022-02-20 18:48:49,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:49,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857729462] [2022-02-20 18:48:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:49,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3289#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {3289#true} is VALID [2022-02-20 18:48:49,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3289#true} is VALID [2022-02-20 18:48:49,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume 0 == ~r1~0 % 256; {3289#true} is VALID [2022-02-20 18:48:49,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {3289#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3289#true} is VALID [2022-02-20 18:48:49,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {3289#true} assume ~id1~0 >= 0; {3289#true} is VALID [2022-02-20 18:48:49,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} assume 0 == ~st1~0; {3289#true} is VALID [2022-02-20 18:48:49,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {3289#true} assume ~send1~0 == ~id1~0; {3289#true} is VALID [2022-02-20 18:48:49,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {3289#true} assume 0 == ~mode1~0 % 256; {3289#true} is VALID [2022-02-20 18:48:49,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {3289#true} assume ~id2~0 >= 0; {3289#true} is VALID [2022-02-20 18:48:49,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} assume 0 == ~st2~0; {3289#true} is VALID [2022-02-20 18:48:49,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume ~send2~0 == ~id2~0; {3289#true} is VALID [2022-02-20 18:48:49,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume 0 == ~mode2~0 % 256; {3289#true} is VALID [2022-02-20 18:48:49,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {3289#true} assume ~id3~0 >= 0; {3289#true} is VALID [2022-02-20 18:48:49,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {3289#true} assume 0 == ~st3~0; {3289#true} is VALID [2022-02-20 18:48:49,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} assume ~send3~0 == ~id3~0; {3289#true} is VALID [2022-02-20 18:48:49,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume 0 == ~mode3~0 % 256; {3289#true} is VALID [2022-02-20 18:48:49,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume ~id4~0 >= 0; {3289#true} is VALID [2022-02-20 18:48:49,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {3289#true} assume 0 == ~st4~0; {3289#true} is VALID [2022-02-20 18:48:49,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {3289#true} assume ~send4~0 == ~id4~0; {3289#true} is VALID [2022-02-20 18:48:49,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} assume 0 == ~mode4~0 % 256; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3291#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:49,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {3291#(= (+ (* (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; {3290#false} is VALID [2022-02-20 18:48:49,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {3290#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3290#false} is VALID [2022-02-20 18:48:49,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {3290#false} ~mode4~0 := 0; {3290#false} is VALID [2022-02-20 18:48:49,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {3290#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3290#false} is VALID [2022-02-20 18:48:49,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {3290#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3290#false} is VALID [2022-02-20 18:48:49,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {3290#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3290#false} is VALID [2022-02-20 18:48:49,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {3290#false} ~mode5~0 := 0; {3290#false} is VALID [2022-02-20 18:48:49,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {3290#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3290#false} is VALID [2022-02-20 18:48:49,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {3290#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {3290#false} is VALID [2022-02-20 18:48:49,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {3290#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {3290#false} is VALID [2022-02-20 18:48:49,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {3290#false} assume 0 == main_~assert__arg~0#1 % 256; {3290#false} is VALID [2022-02-20 18:48:49,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-02-20 18:48:49,178 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:48:49,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:49,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857729462] [2022-02-20 18:48:49,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857729462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:49,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:49,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:49,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761663481] [2022-02-20 18:48:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:48:49,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:49,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:49,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:49,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:49,235 INFO L87 Difference]: Start difference. First operand 365 states and 560 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:49,580 INFO L93 Difference]: Finished difference Result 961 states and 1506 transitions. [2022-02-20 18:48:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:48:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:49,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions. [2022-02-20 18:48:49,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:49,954 INFO L225 Difference]: With dead ends: 961 [2022-02-20 18:48:49,954 INFO L226 Difference]: Without dead ends: 631 [2022-02-20 18:48:49,955 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:48:49,956 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 132 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 409 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:48:49,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 409 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-02-20 18:48:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2022-02-20 18:48:49,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:49,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 631 states. Second operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,995 INFO L74 IsIncluded]: Start isIncluded. First operand 631 states. Second operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:49,996 INFO L87 Difference]: Start difference. First operand 631 states. Second operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:50,020 INFO L93 Difference]: Finished difference Result 631 states and 977 transitions. [2022-02-20 18:48:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 977 transitions. [2022-02-20 18:48:50,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:50,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:50,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 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 631 states. [2022-02-20 18:48:50,024 INFO L87 Difference]: Start difference. First operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 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 631 states. [2022-02-20 18:48:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:50,046 INFO L93 Difference]: Finished difference Result 631 states and 977 transitions. [2022-02-20 18:48:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 977 transitions. [2022-02-20 18:48:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:50,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:50,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:50,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 976 transitions. [2022-02-20 18:48:50,080 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 976 transitions. Word has length 63 [2022-02-20 18:48:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:50,081 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 976 transitions. [2022-02-20 18:48:50,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 976 transitions. [2022-02-20 18:48:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:48:50,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:50,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:50,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:48:50,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 92320152, now seen corresponding path program 1 times [2022-02-20 18:48:50,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:50,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453843396] [2022-02-20 18:48:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:50,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {6738#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {6738#true} is VALID [2022-02-20 18:48:50,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {6738#true} is VALID [2022-02-20 18:48:50,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume 0 == ~r1~0 % 256; {6738#true} is VALID [2022-02-20 18:48:50,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {6738#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {6738#true} is VALID [2022-02-20 18:48:50,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {6738#true} assume ~id1~0 >= 0; {6738#true} is VALID [2022-02-20 18:48:50,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {6738#true} assume 0 == ~st1~0; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {6738#true} assume ~send1~0 == ~id1~0; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6738#true} assume 0 == ~mode1~0 % 256; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6738#true} assume ~id2~0 >= 0; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {6738#true} assume 0 == ~st2~0; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {6738#true} assume ~send2~0 == ~id2~0; {6738#true} is VALID [2022-02-20 18:48:50,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {6738#true} assume 0 == ~mode2~0 % 256; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {6738#true} assume ~id3~0 >= 0; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {6738#true} assume 0 == ~st3~0; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {6738#true} assume ~send3~0 == ~id3~0; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {6738#true} assume 0 == ~mode3~0 % 256; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {6738#true} assume ~id4~0 >= 0; {6738#true} is VALID [2022-02-20 18:48:50,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {6738#true} assume 0 == ~st4~0; {6738#true} is VALID [2022-02-20 18:48:50,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {6738#true} assume ~send4~0 == ~id4~0; {6738#true} is VALID [2022-02-20 18:48:50,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {6738#true} assume 0 == ~mode4~0 % 256; {6738#true} is VALID [2022-02-20 18:48:50,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {6738#true} assume ~id5~0 >= 0; {6738#true} is VALID [2022-02-20 18:48:50,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {6738#true} assume 0 == ~st5~0; {6738#true} is VALID [2022-02-20 18:48:50,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {6738#true} assume ~send5~0 == ~id5~0; {6738#true} is VALID [2022-02-20 18:48:50,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {6738#true} assume 0 == ~mode5~0 % 256; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive1~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive2~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive3~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive4~0 % 256); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:50,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {6740#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6739#false} is VALID [2022-02-20 18:48:50,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {6739#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {6739#false} ~mode5~0 := 0; {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {6739#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {6739#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {6739#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {6739#false} assume 0 == main_~assert__arg~0#1 % 256; {6739#false} is VALID [2022-02-20 18:48:50,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-02-20 18:48:50,176 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:48:50,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:50,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453843396] [2022-02-20 18:48:50,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453843396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:50,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:50,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:50,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176550041] [2022-02-20 18:48:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:50,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:48:50,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:50,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:50,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:50,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:50,231 INFO L87 Difference]: Start difference. First operand 629 states and 976 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:50,689 INFO L93 Difference]: Finished difference Result 1689 states and 2650 transitions. [2022-02-20 18:48:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:48:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:48:50,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions. [2022-02-20 18:48:51,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:51,121 INFO L225 Difference]: With dead ends: 1689 [2022-02-20 18:48:51,121 INFO L226 Difference]: Without dead ends: 1095 [2022-02-20 18:48:51,122 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:48:51,123 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 127 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 394 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:48:51,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-02-20 18:48:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2022-02-20 18:48:51,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:51,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,189 INFO L74 IsIncluded]: Start isIncluded. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,191 INFO L87 Difference]: Start difference. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:51,247 INFO L93 Difference]: Finished difference Result 1095 states and 1701 transitions. [2022-02-20 18:48:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1701 transitions. [2022-02-20 18:48:51,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:51,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:51,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 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 1095 states. [2022-02-20 18:48:51,253 INFO L87 Difference]: Start difference. First operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 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 1095 states. [2022-02-20 18:48:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:51,311 INFO L93 Difference]: Finished difference Result 1095 states and 1701 transitions. [2022-02-20 18:48:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1701 transitions. [2022-02-20 18:48:51,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:51,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:51,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:51,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1700 transitions. [2022-02-20 18:48:51,381 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1700 transitions. Word has length 64 [2022-02-20 18:48:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:51,381 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1700 transitions. [2022-02-20 18:48:51,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1700 transitions. [2022-02-20 18:48:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:48:51,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:51,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:51,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:48:51,383 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1673406722, now seen corresponding path program 1 times [2022-02-20 18:48:51,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:51,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460643871] [2022-02-20 18:48:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:51,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {12779#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {12779#true} is VALID [2022-02-20 18:48:51,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {12779#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {12779#true} is VALID [2022-02-20 18:48:51,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#true} assume 0 == ~r1~0 % 256; {12779#true} is VALID [2022-02-20 18:48:51,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {12779#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {12779#true} is VALID [2022-02-20 18:48:51,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {12779#true} assume ~id1~0 >= 0; {12779#true} is VALID [2022-02-20 18:48:51,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#true} assume 0 == ~st1~0; {12781#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:51,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {12781#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {12781#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:51,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {12781#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {12781#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:51,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {12781#(<= ~st1~0 0)} assume ~id2~0 >= 0; {12781#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:51,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {12781#(<= ~st1~0 0)} assume 0 == ~st2~0; {12782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {12782#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {12782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {12782#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {12782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {12782#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {12782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {12782#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {12783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {12784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:51,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {12785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {12780#false} is VALID [2022-02-20 18:48:51,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {12780#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {12780#false} is VALID [2022-02-20 18:48:51,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {12780#false} assume 0 == main_~assert__arg~0#1 % 256; {12780#false} is VALID [2022-02-20 18:48:51,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {12780#false} assume !false; {12780#false} is VALID [2022-02-20 18:48:51,506 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:48:51,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:51,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460643871] [2022-02-20 18:48:51,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460643871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:51,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:51,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:51,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125017981] [2022-02-20 18:48:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:48:51,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:51,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:51,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:51,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:51,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:51,563 INFO L87 Difference]: Start difference. First operand 1093 states and 1700 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:58,844 INFO L93 Difference]: Finished difference Result 7441 states and 11690 transitions. [2022-02-20 18:48:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:48:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1148 transitions. [2022-02-20 18:48:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1148 transitions. [2022-02-20 18:48:58,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1148 transitions. [2022-02-20 18:48:59,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1148 edges. 1148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:01,367 INFO L225 Difference]: With dead ends: 7441 [2022-02-20 18:49:01,367 INFO L226 Difference]: Without dead ends: 6383 [2022-02-20 18:49:01,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:49:01,370 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 1477 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:01,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 2341 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2022-02-20 18:49:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 2149. [2022-02-20 18:49:03,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:03,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6383 states. Second operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:03,388 INFO L74 IsIncluded]: Start isIncluded. First operand 6383 states. Second operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:03,392 INFO L87 Difference]: Start difference. First operand 6383 states. Second operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:04,657 INFO L93 Difference]: Finished difference Result 6383 states and 9993 transitions. [2022-02-20 18:49:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6383 states and 9993 transitions. [2022-02-20 18:49:04,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:04,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:04,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 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 6383 states. [2022-02-20 18:49:04,677 INFO L87 Difference]: Start difference. First operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 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 6383 states. [2022-02-20 18:49:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:06,003 INFO L93 Difference]: Finished difference Result 6383 states and 9993 transitions. [2022-02-20 18:49:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6383 states and 9993 transitions. [2022-02-20 18:49:06,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:06,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:06,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:06,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3332 transitions. [2022-02-20 18:49:06,255 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3332 transitions. Word has length 65 [2022-02-20 18:49:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:06,256 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 3332 transitions. [2022-02-20 18:49:06,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3332 transitions. [2022-02-20 18:49:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:49:06,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:06,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:06,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:06,257 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -355457067, now seen corresponding path program 1 times [2022-02-20 18:49:06,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:06,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501499771] [2022-02-20 18:49:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:06,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {38897#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {38897#true} is VALID [2022-02-20 18:49:06,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {38897#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {38897#true} is VALID [2022-02-20 18:49:06,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {38897#true} assume 0 == ~r1~0 % 256; {38897#true} is VALID [2022-02-20 18:49:06,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {38897#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:06,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {38899#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:06,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:06,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:06,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:06,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:06,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {38900#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:06,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:06,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:06,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:06,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:06,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {38901#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:06,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:06,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:06,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:06,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:06,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {38902#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:06,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:06,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1; {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:06,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:06,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:06,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {38903#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {38898#false} is VALID [2022-02-20 18:49:06,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {38898#false} assume !(~send5~0 != ~id5~0); {38898#false} is VALID [2022-02-20 18:49:06,456 INFO L290 TraceCheckUtils]: 59: Hoare triple {38898#false} ~mode5~0 := 1; {38898#false} is VALID [2022-02-20 18:49:06,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {38898#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {38898#false} is VALID [2022-02-20 18:49:06,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {38898#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {38898#false} is VALID [2022-02-20 18:49:06,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {38898#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {38898#false} is VALID [2022-02-20 18:49:06,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {38898#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {38898#false} is VALID [2022-02-20 18:49:06,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {38898#false} assume 0 == main_~assert__arg~0#1 % 256; {38898#false} is VALID [2022-02-20 18:49:06,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {38898#false} assume !false; {38898#false} is VALID [2022-02-20 18:49:06,462 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:49:06,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:06,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501499771] [2022-02-20 18:49:06,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501499771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:06,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:06,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:49:06,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049777645] [2022-02-20 18:49:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:49:06,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:06,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:06,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:06,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:49:06,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:49:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:06,541 INFO L87 Difference]: Start difference. First operand 2149 states and 3332 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:22,428 INFO L93 Difference]: Finished difference Result 11279 states and 17449 transitions. [2022-02-20 18:49:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:49:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:49:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2022-02-20 18:49:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2022-02-20 18:49:22,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 849 transitions. [2022-02-20 18:49:23,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 849 edges. 849 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:26,375 INFO L225 Difference]: With dead ends: 11279 [2022-02-20 18:49:26,375 INFO L226 Difference]: Without dead ends: 9165 [2022-02-20 18:49:26,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:26,380 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 709 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:26,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 1230 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9165 states. [2022-02-20 18:49:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9165 to 9157. [2022-02-20 18:49:36,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:36,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9165 states. Second operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:36,098 INFO L74 IsIncluded]: Start isIncluded. First operand 9165 states. Second operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:36,112 INFO L87 Difference]: Start difference. First operand 9165 states. Second operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:38,478 INFO L93 Difference]: Finished difference Result 9165 states and 14120 transitions. [2022-02-20 18:49:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 14120 transitions. [2022-02-20 18:49:38,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:38,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:38,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 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 9165 states. [2022-02-20 18:49:38,517 INFO L87 Difference]: Start difference. First operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 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 9165 states. [2022-02-20 18:49:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:41,030 INFO L93 Difference]: Finished difference Result 9165 states and 14120 transitions. [2022-02-20 18:49:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 14120 transitions. [2022-02-20 18:49:41,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:41,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:41,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:41,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9157 states to 9157 states and 14116 transitions. [2022-02-20 18:49:44,324 INFO L78 Accepts]: Start accepts. Automaton has 9157 states and 14116 transitions. Word has length 66 [2022-02-20 18:49:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:44,324 INFO L470 AbstractCegarLoop]: Abstraction has 9157 states and 14116 transitions. [2022-02-20 18:49:44,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9157 states and 14116 transitions. [2022-02-20 18:49:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:49:44,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:44,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:44,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:49:44,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1716189444, now seen corresponding path program 1 times [2022-02-20 18:49:44,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:44,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574279192] [2022-02-20 18:49:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:44,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {85800#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_58418~0 := 0;~__return_58583~0 := 0; {85800#true} is VALID [2022-02-20 18:49:44,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {85800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {85800#true} is VALID [2022-02-20 18:49:44,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {85800#true} assume 0 == ~r1~0 % 256; {85800#true} is VALID [2022-02-20 18:49:44,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {85800#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {85800#true} is VALID [2022-02-20 18:49:44,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {85800#true} assume ~id1~0 >= 0; {85800#true} is VALID [2022-02-20 18:49:44,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {85800#true} assume 0 == ~st1~0; {85800#true} is VALID [2022-02-20 18:49:44,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {85800#true} assume ~send1~0 == ~id1~0; {85800#true} is VALID [2022-02-20 18:49:44,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {85800#true} assume 0 == ~mode1~0 % 256; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:44,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {85802#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {85801#false} assume !(255 == ~r1~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {85801#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {85801#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {85801#false} ~mode1~0 := 0; {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {85801#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {85801#false} assume !!(0 == ~mode2~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {85801#false} assume !!(0 == ~alive2~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {85801#false} assume !(~send2~0 != ~id2~0); {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {85801#false} ~mode2~0 := 1; {85801#false} is VALID [2022-02-20 18:49:44,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {85801#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {85801#false} assume !!(0 == ~mode3~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {85801#false} assume !!(0 == ~alive3~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {85801#false} assume !(~send3~0 != ~id3~0); {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {85801#false} ~mode3~0 := 1; {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {85801#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {85801#false} assume !!(0 == ~mode4~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {85801#false} assume !!(0 == ~alive4~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {85801#false} assume !(~send4~0 != ~id4~0); {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {85801#false} ~mode4~0 := 1; {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {85801#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {85801#false} assume !!(0 == ~mode5~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {85801#false} assume !!(0 == ~alive5~0 % 256); {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {85801#false} assume !(~send5~0 != ~id5~0); {85801#false} is VALID [2022-02-20 18:49:44,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {85801#false} ~mode5~0 := 1; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {85801#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {85801#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {85801#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {85801#false} ~__return_58583~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58583~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; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {85801#false} assume 0 == main_~assert__arg~0#1 % 256; {85801#false} is VALID [2022-02-20 18:49:44,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {85801#false} assume !false; {85801#false} is VALID [2022-02-20 18:49:44,424 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:49:44,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:44,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574279192] [2022-02-20 18:49:44,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574279192] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:44,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:44,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:44,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797961926] [2022-02-20 18:49:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:49:44,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:44,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:44,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:44,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:44,481 INFO L87 Difference]: Start difference. First operand 9157 states and 14116 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)