./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.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.3.2.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 0451b84ecb7a9b49daa0d007f78b5b7787a8fa890fb4c838a3b9a1c5be28a03a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:29,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:29,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:29,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:29,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:29,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:29,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:29,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:29,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:29,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:29,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:29,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:29,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:29,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:29,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:29,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:29,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:29,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:29,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:29,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:29,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:29,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:29,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:29,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:29,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:29,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:29,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:29,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:29,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:29,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:29,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:29,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:29,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:29,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:29,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:29,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:29,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:29,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:29,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:29,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:29,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:29,390 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:44:29,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:29,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:29,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:29,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:29,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:29,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:29,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:29,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:29,422 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:29,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:29,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:29,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:29,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:29,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:29,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:29,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:29,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:29,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:29,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:29,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:29,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:29,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:29,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:29,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:29,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:29,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:29,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:29,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:29,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:29,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:29,427 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:29,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:29,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:29,427 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 -> 0451b84ecb7a9b49daa0d007f78b5b7787a8fa890fb4c838a3b9a1c5be28a03a [2022-02-20 18:44:29,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:29,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:29,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:29,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:29,703 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:29,704 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.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:44:29,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b254c3b48/f319b52b69634cf6a10354d1005e48a6/FLAG7588e27e5 [2022-02-20 18:44:30,203 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:30,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:44:30,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b254c3b48/f319b52b69634cf6a10354d1005e48a6/FLAG7588e27e5 [2022-02-20 18:44:30,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b254c3b48/f319b52b69634cf6a10354d1005e48a6 [2022-02-20 18:44:30,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:30,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:30,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:30,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:30,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:30,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb2b9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30, skipping insertion in model container [2022-02-20 18:44:30,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:30,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:30,806 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.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2022-02-20 18:44:30,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:30,837 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:30,873 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.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2022-02-20 18:44:30,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:30,900 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:30,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30 WrapperNode [2022-02-20 18:44:30,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:30,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:30,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:30,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:30,910 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:44:30" (1/1) ... [2022-02-20 18:44:30,921 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:44:30" (1/1) ... [2022-02-20 18:44:30,956 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 316 [2022-02-20 18:44:30,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:30,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:30,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:30,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:30,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:31,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:31,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:31,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:31,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:31,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:31,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:31,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:31,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:31,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:31,062 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:44:31,064 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:44:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:31,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:31,211 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:31,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:31,685 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:31,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:31,691 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:31,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:31 BoogieIcfgContainer [2022-02-20 18:44:31,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:31,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:31,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:31,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:31,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:30" (1/3) ... [2022-02-20 18:44:31,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0a86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:31, skipping insertion in model container [2022-02-20 18:44:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30" (2/3) ... [2022-02-20 18:44:31,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0a86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:31, skipping insertion in model container [2022-02-20 18:44:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:31" (3/3) ... [2022-02-20 18:44:31,700 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:44:31,704 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:31,704 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:44:31,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:31,760 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:44:31,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:44:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.675) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:44:31,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:31,784 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] [2022-02-20 18:44:31,784 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1356231251, now seen corresponding path program 1 times [2022-02-20 18:44:31,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:31,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242912264] [2022-02-20 18:44:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:32,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {85#true} is VALID [2022-02-20 18:44:32,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {85#true} is VALID [2022-02-20 18:44:32,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} assume 0 == ~r1~0 % 256; {85#true} is VALID [2022-02-20 18:44:32,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {85#true} is VALID [2022-02-20 18:44:32,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#true} assume ~id1~0 >= 0; {85#true} is VALID [2022-02-20 18:44:32,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} assume 0 == ~st1~0; {85#true} is VALID [2022-02-20 18:44:32,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} assume ~send1~0 == ~id1~0; {85#true} is VALID [2022-02-20 18:44:32,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#true} assume 0 == ~mode1~0 % 256; {85#true} is VALID [2022-02-20 18:44:32,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {85#true} assume ~id2~0 >= 0; {85#true} is VALID [2022-02-20 18:44:32,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {85#true} assume 0 == ~st2~0; {85#true} is VALID [2022-02-20 18:44:32,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#true} assume ~send2~0 == ~id2~0; {85#true} is VALID [2022-02-20 18:44:32,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {85#true} assume 0 == ~mode2~0 % 256; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {87#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {87#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:44:32,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {87#(= (+ (* (- 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; {86#false} is VALID [2022-02-20 18:44:32,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {86#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {86#false} is VALID [2022-02-20 18:44:32,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {86#false} ~mode2~0 := 0; {86#false} is VALID [2022-02-20 18:44:32,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {86#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {86#false} is VALID [2022-02-20 18:44:32,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {86#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {86#false} is VALID [2022-02-20 18:44:32,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {86#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {86#false} is VALID [2022-02-20 18:44:32,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {86#false} ~mode3~0 := 0; {86#false} is VALID [2022-02-20 18:44:32,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {86#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;havoc main_~check__tmp~0#1; {86#false} is VALID [2022-02-20 18:44:32,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {86#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {86#false} is VALID [2022-02-20 18:44:32,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {86#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {86#false} is VALID [2022-02-20 18:44:32,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {86#false} assume 0 == main_~assert__arg~0#1 % 256; {86#false} is VALID [2022-02-20 18:44:32,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {86#false} assume !false; {86#false} is VALID [2022-02-20 18:44:32,055 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:44:32,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:32,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242912264] [2022-02-20 18:44:32,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242912264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:32,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:32,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:32,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096907545] [2022-02-20 18:44:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:44:32,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:32,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:32,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:32,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:32,145 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.675) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,468 INFO L93 Difference]: Finished difference Result 190 states and 300 transitions. [2022-02-20 18:44:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:44:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-02-20 18:44:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-02-20 18:44:32,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 300 transitions. [2022-02-20 18:44:32,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:32,801 INFO L225 Difference]: With dead ends: 190 [2022-02-20 18:44:32,801 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 18:44:32,804 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:44:32,807 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 87 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 267 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:44:32,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 18:44:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-02-20 18:44:32,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:32,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,842 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,843 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,850 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-02-20 18:44:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-02-20 18:44:32,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:32,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:32,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-20 18:44:32,852 INFO L87 Difference]: Start difference. First operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-20 18:44:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,858 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-02-20 18:44:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-02-20 18:44:32,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:32,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:32,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:32,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2022-02-20 18:44:32,867 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 37 [2022-02-20 18:44:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:32,867 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2022-02-20 18:44:32,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2022-02-20 18:44:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:44:32,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:32,869 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] [2022-02-20 18:44:32,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:32,870 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash -775084619, now seen corresponding path program 1 times [2022-02-20 18:44:32,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:32,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986808448] [2022-02-20 18:44:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:32,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {745#true} is VALID [2022-02-20 18:44:32,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {745#true} is VALID [2022-02-20 18:44:32,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {745#true} assume 0 == ~r1~0 % 256; {745#true} is VALID [2022-02-20 18:44:32,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {745#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {745#true} is VALID [2022-02-20 18:44:32,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {745#true} assume ~id1~0 >= 0; {745#true} is VALID [2022-02-20 18:44:32,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {745#true} assume 0 == ~st1~0; {745#true} is VALID [2022-02-20 18:44:32,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#true} assume ~send1~0 == ~id1~0; {745#true} is VALID [2022-02-20 18:44:32,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {745#true} assume 0 == ~mode1~0 % 256; {745#true} is VALID [2022-02-20 18:44:32,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {745#true} assume ~id2~0 >= 0; {745#true} is VALID [2022-02-20 18:44:32,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#true} assume 0 == ~st2~0; {745#true} is VALID [2022-02-20 18:44:32,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {745#true} assume ~send2~0 == ~id2~0; {745#true} is VALID [2022-02-20 18:44:32,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {745#true} assume 0 == ~mode2~0 % 256; {745#true} is VALID [2022-02-20 18:44:32,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#true} assume ~id3~0 >= 0; {745#true} is VALID [2022-02-20 18:44:32,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {745#true} assume 0 == ~st3~0; {745#true} is VALID [2022-02-20 18:44:32,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {745#true} assume ~send3~0 == ~id3~0; {745#true} is VALID [2022-02-20 18:44:32,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {745#true} assume 0 == ~mode3~0 % 256; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {747#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {747#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:44:32,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {747#(= (+ (* (- 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; {746#false} is VALID [2022-02-20 18:44:32,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {746#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {746#false} is VALID [2022-02-20 18:44:32,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {746#false} ~mode3~0 := 0; {746#false} is VALID [2022-02-20 18:44:32,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {746#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;havoc main_~check__tmp~0#1; {746#false} is VALID [2022-02-20 18:44:32,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {746#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {746#false} is VALID [2022-02-20 18:44:32,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {746#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {746#false} is VALID [2022-02-20 18:44:32,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {746#false} assume 0 == main_~assert__arg~0#1 % 256; {746#false} is VALID [2022-02-20 18:44:32,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {746#false} assume !false; {746#false} is VALID [2022-02-20 18:44:32,994 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:44:32,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:32,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986808448] [2022-02-20 18:44:32,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986808448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:32,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:32,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:32,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107006852] [2022-02-20 18:44:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:44:32,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:32,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:33,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:33,034 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,240 INFO L93 Difference]: Finished difference Result 288 states and 442 transitions. [2022-02-20 18:44:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:44:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:44:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:44:33,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:44:33,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,482 INFO L225 Difference]: With dead ends: 288 [2022-02-20 18:44:33,482 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 18:44:33,486 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:44:33,487 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 219 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:44:33,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 18:44:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-02-20 18:44:33,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:33,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,530 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,531 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,538 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2022-02-20 18:44:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2022-02-20 18:44:33,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:33,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:33,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:44:33,545 INFO L87 Difference]: Start difference. First operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:44:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,555 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2022-02-20 18:44:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2022-02-20 18:44:33,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:33,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:33,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:33,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2022-02-20 18:44:33,566 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 38 [2022-02-20 18:44:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:33,568 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2022-02-20 18:44:33,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2022-02-20 18:44:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:44:33,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:33,574 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] [2022-02-20 18:44:33,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:33,575 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1501816372, now seen corresponding path program 1 times [2022-02-20 18:44:33,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:33,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807165759] [2022-02-20 18:44:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:33,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {1766#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {1766#true} is VALID [2022-02-20 18:44:33,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {1766#true} is VALID [2022-02-20 18:44:33,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#true} assume 0 == ~r1~0 % 256; {1766#true} is VALID [2022-02-20 18:44:33,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {1766#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1766#true} is VALID [2022-02-20 18:44:33,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {1766#true} assume ~id1~0 >= 0; {1766#true} is VALID [2022-02-20 18:44:33,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {1766#true} assume 0 == ~st1~0; {1768#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {1768#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1768#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1768#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1768#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1768#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1768#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1768#(<= ~st1~0 0)} assume 0 == ~st2~0; {1769#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {1769#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1769#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {1769#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1769#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {1769#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1769#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {1769#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#(<= (+ ~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;main_~main__i2~0#1 := 0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#(<= (+ ~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;havoc main_~check__tmp~0#1; {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1767#false} is VALID [2022-02-20 18:44:33,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {1767#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {1767#false} is VALID [2022-02-20 18:44:33,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {1767#false} assume 0 == main_~assert__arg~0#1 % 256; {1767#false} is VALID [2022-02-20 18:44:33,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {1767#false} assume !false; {1767#false} is VALID [2022-02-20 18:44:33,698 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:44:33,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:33,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807165759] [2022-02-20 18:44:33,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807165759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:33,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:33,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:33,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303446246] [2022-02-20 18:44:33,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:44:33,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:33,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:33,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:33,730 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:34,611 INFO L93 Difference]: Finished difference Result 850 states and 1325 transitions. [2022-02-20 18:44:34,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:44:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-02-20 18:44:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-02-20 18:44:34,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 485 transitions. [2022-02-20 18:44:34,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,021 INFO L225 Difference]: With dead ends: 850 [2022-02-20 18:44:35,022 INFO L226 Difference]: Without dead ends: 684 [2022-02-20 18:44:35,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:35,031 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 462 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:35,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 620 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-02-20 18:44:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 350. [2022-02-20 18:44:35,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:35,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 684 states. Second operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,217 INFO L74 IsIncluded]: Start isIncluded. First operand 684 states. Second operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,218 INFO L87 Difference]: Start difference. First operand 684 states. Second operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,246 INFO L93 Difference]: Finished difference Result 684 states and 1056 transitions. [2022-02-20 18:44:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1056 transitions. [2022-02-20 18:44:35,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 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 684 states. [2022-02-20 18:44:35,249 INFO L87 Difference]: Start difference. First operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 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 684 states. [2022-02-20 18:44:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,278 INFO L93 Difference]: Finished difference Result 684 states and 1056 transitions. [2022-02-20 18:44:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1056 transitions. [2022-02-20 18:44:35,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:35,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 533 transitions. [2022-02-20 18:44:35,293 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 533 transitions. Word has length 39 [2022-02-20 18:44:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:35,293 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 533 transitions. [2022-02-20 18:44:35,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 533 transitions. [2022-02-20 18:44:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:44:35,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:35,294 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] [2022-02-20 18:44:35,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:35,295 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash -707789038, now seen corresponding path program 1 times [2022-02-20 18:44:35,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:35,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489162097] [2022-02-20 18:44:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:35,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {4794#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {4794#true} is VALID [2022-02-20 18:44:35,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {4794#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {4794#true} is VALID [2022-02-20 18:44:35,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {4794#true} assume 0 == ~r1~0 % 256; {4794#true} is VALID [2022-02-20 18:44:35,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {4794#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~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;main_~main__i2~0#1 := 0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:44:35,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {4796#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:44:35,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:44:35,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:44:35,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:44:35,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {4797#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:44:35,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:44:35,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:44:35,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:44:35,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~mode3~0 % 256); {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:44:35,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {4798#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~alive3~0 % 256); {4795#false} is VALID [2022-02-20 18:44:35,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {4795#false} assume !(~send3~0 != ~id3~0); {4795#false} is VALID [2022-02-20 18:44:35,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {4795#false} ~mode3~0 := 1; {4795#false} is VALID [2022-02-20 18:44:35,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {4795#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;havoc main_~check__tmp~0#1; {4795#false} is VALID [2022-02-20 18:44:35,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {4795#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4795#false} is VALID [2022-02-20 18:44:35,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {4795#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {4795#false} is VALID [2022-02-20 18:44:35,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {4795#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {4795#false} is VALID [2022-02-20 18:44:35,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {4795#false} assume 0 == main_~assert__arg~0#1 % 256; {4795#false} is VALID [2022-02-20 18:44:35,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {4795#false} assume !false; {4795#false} is VALID [2022-02-20 18:44:35,432 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:44:35,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:35,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489162097] [2022-02-20 18:44:35,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489162097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:35,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:35,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:35,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855772494] [2022-02-20 18:44:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:44:35,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:35,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:35,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:35,470 INFO L87 Difference]: Start difference. First operand 350 states and 533 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,690 INFO L93 Difference]: Finished difference Result 1228 states and 1888 transitions. [2022-02-20 18:44:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:44:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2022-02-20 18:44:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2022-02-20 18:44:36,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 346 transitions. [2022-02-20 18:44:36,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,047 INFO L225 Difference]: With dead ends: 1228 [2022-02-20 18:44:37,047 INFO L226 Difference]: Without dead ends: 898 [2022-02-20 18:44:37,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:37,049 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 290 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:37,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 376 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-02-20 18:44:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2022-02-20 18:44:37,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:37,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 898 states. Second operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,671 INFO L74 IsIncluded]: Start isIncluded. First operand 898 states. Second operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,673 INFO L87 Difference]: Start difference. First operand 898 states. Second operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,712 INFO L93 Difference]: Finished difference Result 898 states and 1367 transitions. [2022-02-20 18:44:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1367 transitions. [2022-02-20 18:44:37,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 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 898 states. [2022-02-20 18:44:37,718 INFO L87 Difference]: Start difference. First operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 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 898 states. [2022-02-20 18:44:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,757 INFO L93 Difference]: Finished difference Result 898 states and 1367 transitions. [2022-02-20 18:44:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1367 transitions. [2022-02-20 18:44:37,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:37,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1365 transitions. [2022-02-20 18:44:37,812 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1365 transitions. Word has length 40 [2022-02-20 18:44:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:37,812 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1365 transitions. [2022-02-20 18:44:37,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1365 transitions. [2022-02-20 18:44:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:44:37,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:37,813 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] [2022-02-20 18:44:37,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:37,814 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1119396873, now seen corresponding path program 1 times [2022-02-20 18:44:37,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:37,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561579675] [2022-02-20 18:44:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:37,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {9535#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {9537#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:37,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {9537#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {9538#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:37,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {9538#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {9538#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:37,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {9538#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9539#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:37,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {9539#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {9536#false} is VALID [2022-02-20 18:44:37,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {9536#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {9536#false} is VALID [2022-02-20 18:44:37,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {9536#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {9536#false} is VALID [2022-02-20 18:44:37,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {9536#false} ~mode2~0 := 1; {9536#false} is VALID [2022-02-20 18:44:37,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {9536#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9536#false} is VALID [2022-02-20 18:44:37,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {9536#false} assume !!(0 == ~mode3~0 % 256); {9536#false} is VALID [2022-02-20 18:44:37,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {9536#false} assume !!(0 == ~alive3~0 % 256); {9536#false} is VALID [2022-02-20 18:44:37,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {9536#false} assume !(~send3~0 != ~id3~0); {9536#false} is VALID [2022-02-20 18:44:37,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {9536#false} ~mode3~0 := 1; {9536#false} is VALID [2022-02-20 18:44:37,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {9536#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;havoc main_~check__tmp~0#1; {9536#false} is VALID [2022-02-20 18:44:37,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {9536#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9536#false} is VALID [2022-02-20 18:44:37,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {9536#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {9536#false} is VALID [2022-02-20 18:44:37,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {9536#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {9536#false} is VALID [2022-02-20 18:44:37,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {9536#false} assume 0 == main_~assert__arg~0#1 % 256; {9536#false} is VALID [2022-02-20 18:44:37,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {9536#false} assume !false; {9536#false} is VALID [2022-02-20 18:44:37,942 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:44:37,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:37,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561579675] [2022-02-20 18:44:37,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561579675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:37,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:37,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:37,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201485994] [2022-02-20 18:44:37,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:44:37,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:37,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:37,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:37,975 INFO L87 Difference]: Start difference. First operand 894 states and 1365 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:40,931 INFO L93 Difference]: Finished difference Result 2642 states and 4055 transitions. [2022-02-20 18:44:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:44:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:44:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:44:40,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 299 transitions. [2022-02-20 18:44:41,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:41,390 INFO L225 Difference]: With dead ends: 2642 [2022-02-20 18:44:41,391 INFO L226 Difference]: Without dead ends: 1768 [2022-02-20 18:44:41,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:41,393 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 470 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:41,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 137 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-02-20 18:44:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2022-02-20 18:44:43,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:43,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1768 states. Second operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,385 INFO L74 IsIncluded]: Start isIncluded. First operand 1768 states. Second operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,388 INFO L87 Difference]: Start difference. First operand 1768 states. Second operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,509 INFO L93 Difference]: Finished difference Result 1768 states and 2694 transitions. [2022-02-20 18:44:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2694 transitions. [2022-02-20 18:44:43,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 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 1768 states. [2022-02-20 18:44:43,520 INFO L87 Difference]: Start difference. First operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 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 1768 states. [2022-02-20 18:44:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,658 INFO L93 Difference]: Finished difference Result 1768 states and 2694 transitions. [2022-02-20 18:44:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2694 transitions. [2022-02-20 18:44:43,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:43,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2693 transitions. [2022-02-20 18:44:43,861 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2693 transitions. Word has length 42 [2022-02-20 18:44:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:43,861 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2693 transitions. [2022-02-20 18:44:43,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2693 transitions. [2022-02-20 18:44:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:44:43,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:43,862 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] [2022-02-20 18:44:43,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:43,862 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:43,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1549405756, now seen corresponding path program 1 times [2022-02-20 18:44:43,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:43,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857170068] [2022-02-20 18:44:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:43,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {19210#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {19210#true} is VALID [2022-02-20 18:44:43,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {19210#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {19210#true} is VALID [2022-02-20 18:44:43,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {19210#true} assume 0 == ~r1~0 % 256; {19210#true} is VALID [2022-02-20 18:44:43,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {19210#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {19210#true} is VALID [2022-02-20 18:44:43,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {19210#true} assume ~id1~0 >= 0; {19210#true} is VALID [2022-02-20 18:44:43,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {19210#true} assume 0 == ~st1~0; {19210#true} is VALID [2022-02-20 18:44:43,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {19210#true} assume ~send1~0 == ~id1~0; {19210#true} is VALID [2022-02-20 18:44:43,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {19210#true} assume 0 == ~mode1~0 % 256; {19210#true} is VALID [2022-02-20 18:44:43,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {19210#true} assume ~id2~0 >= 0; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {19210#true} assume 0 == ~st2~0; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {19210#true} assume ~send2~0 == ~id2~0; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {19210#true} assume 0 == ~mode2~0 % 256; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {19210#true} assume ~id3~0 >= 0; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {19210#true} assume 0 == ~st3~0; {19210#true} is VALID [2022-02-20 18:44:43,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {19210#true} assume ~send3~0 == ~id3~0; {19210#true} is VALID [2022-02-20 18:44:43,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {19210#true} assume 0 == ~mode3~0 % 256; {19210#true} is VALID [2022-02-20 18:44:43,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {19210#true} assume ~id1~0 != ~id2~0; {19210#true} is VALID [2022-02-20 18:44:43,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {19210#true} assume ~id1~0 != ~id3~0; {19210#true} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {19210#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {19212#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {19212#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19210#true} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {19210#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19210#true} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {19210#true} assume !!(0 == ~mode1~0 % 256); {19210#true} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {19210#true} assume !!(0 == ~alive1~0 % 256); {19210#true} is VALID [2022-02-20 18:44:43,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {19210#true} ~mode1~0 := 1; {19210#true} is VALID [2022-02-20 18:44:43,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {19210#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19210#true} is VALID [2022-02-20 18:44:43,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {19210#true} assume !!(0 == ~mode2~0 % 256); {19210#true} is VALID [2022-02-20 18:44:43,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {19210#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19210#true} is VALID [2022-02-20 18:44:43,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {19210#true} assume ~send2~0 != ~nomsg~0; {19210#true} is VALID [2022-02-20 18:44:43,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {19210#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {19210#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {19210#true} ~mode2~0 := 1; {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {19210#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {19210#true} assume !!(0 == ~mode3~0 % 256); {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {19210#true} assume !!(0 == ~alive3~0 % 256); {19210#true} is VALID [2022-02-20 18:44:43,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {19210#true} assume !(~send3~0 != ~id3~0); {19210#true} is VALID [2022-02-20 18:44:43,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {19210#true} ~mode3~0 := 1; {19210#true} is VALID [2022-02-20 18:44:43,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {19210#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19210#true} is VALID [2022-02-20 18:44:43,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {19210#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19210#true} is VALID [2022-02-20 18:44:43,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {19210#true} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {19213#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:44:43,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {19213#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {19214#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:44:43,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {19214#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {19211#false} is VALID [2022-02-20 18:44:43,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {19211#false} assume !false; {19211#false} is VALID [2022-02-20 18:44:43,988 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:44:43,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:43,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857170068] [2022-02-20 18:44:43,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857170068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:43,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:43,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:43,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157786533] [2022-02-20 18:44:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:44:43,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:43,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:44,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:44,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:44,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:44,025 INFO L87 Difference]: Start difference. First operand 1766 states and 2693 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:49,771 INFO L93 Difference]: Finished difference Result 3608 states and 5462 transitions. [2022-02-20 18:44:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:44:49,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:44:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2022-02-20 18:44:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2022-02-20 18:44:49,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 208 transitions. [2022-02-20 18:44:49,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:50,472 INFO L225 Difference]: With dead ends: 3608 [2022-02-20 18:44:50,473 INFO L226 Difference]: Without dead ends: 3606 [2022-02-20 18:44:50,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:44:50,474 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 174 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:50,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 567 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-02-20 18:44:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 1862. [2022-02-20 18:44:53,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:53,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3606 states. Second operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,310 INFO L74 IsIncluded]: Start isIncluded. First operand 3606 states. Second operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,326 INFO L87 Difference]: Start difference. First operand 3606 states. Second operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:53,730 INFO L93 Difference]: Finished difference Result 3606 states and 5413 transitions. [2022-02-20 18:44:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5413 transitions. [2022-02-20 18:44:53,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:53,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:53,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 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 3606 states. [2022-02-20 18:44:53,746 INFO L87 Difference]: Start difference. First operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 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 3606 states. [2022-02-20 18:44:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:54,158 INFO L93 Difference]: Finished difference Result 3606 states and 5413 transitions. [2022-02-20 18:44:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5413 transitions. [2022-02-20 18:44:54,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:54,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:54,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:54,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2789 transitions. [2022-02-20 18:44:54,313 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2789 transitions. Word has length 42 [2022-02-20 18:44:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:54,313 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 2789 transitions. [2022-02-20 18:44:54,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2789 transitions. [2022-02-20 18:44:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:44:54,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:54,314 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] [2022-02-20 18:44:54,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:54,314 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash -776365166, now seen corresponding path program 1 times [2022-02-20 18:44:54,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:54,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159247523] [2022-02-20 18:44:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:54,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {34110#true} is VALID [2022-02-20 18:44:54,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {34110#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {34110#true} is VALID [2022-02-20 18:44:54,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {34110#true} assume 0 == ~r1~0 % 256; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive1~0 % 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive3~0 % 256); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:54,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {34112#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 3); {34111#false} is VALID [2022-02-20 18:44:54,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {34111#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {34111#false} is VALID [2022-02-20 18:44:54,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {34111#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {34111#false} is VALID [2022-02-20 18:44:54,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {34111#false} assume 0 == main_~assert__arg~0#1 % 256; {34111#false} is VALID [2022-02-20 18:44:54,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {34111#false} assume !false; {34111#false} is VALID [2022-02-20 18:44:54,390 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:44:54,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:54,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159247523] [2022-02-20 18:44:54,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159247523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:54,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:54,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:54,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471267597] [2022-02-20 18:44:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:54,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:44:54,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:54,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:54,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:54,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:54,432 INFO L87 Difference]: Start difference. First operand 1862 states and 2789 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,508 INFO L93 Difference]: Finished difference Result 4962 states and 7385 transitions. [2022-02-20 18:45:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:45:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:45:00,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 288 transitions. [2022-02-20 18:45:00,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:01,152 INFO L225 Difference]: With dead ends: 4962 [2022-02-20 18:45:01,152 INFO L226 Difference]: Without dead ends: 3120 [2022-02-20 18:45:01,154 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:45:01,155 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:01,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-02-20 18:45:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3078. [2022-02-20 18:45:06,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:06,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3120 states. Second operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,156 INFO L74 IsIncluded]: Start isIncluded. First operand 3120 states. Second operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,160 INFO L87 Difference]: Start difference. First operand 3120 states. Second operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:06,456 INFO L93 Difference]: Finished difference Result 3120 states and 4536 transitions. [2022-02-20 18:45:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4536 transitions. [2022-02-20 18:45:06,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:06,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:06,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 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 3120 states. [2022-02-20 18:45:06,470 INFO L87 Difference]: Start difference. First operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 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 3120 states. [2022-02-20 18:45:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:06,762 INFO L93 Difference]: Finished difference Result 3120 states and 4536 transitions. [2022-02-20 18:45:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4536 transitions. [2022-02-20 18:45:06,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:06,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:06,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:06,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4495 transitions. [2022-02-20 18:45:07,154 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4495 transitions. Word has length 43 [2022-02-20 18:45:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:07,154 INFO L470 AbstractCegarLoop]: Abstraction has 3078 states and 4495 transitions. [2022-02-20 18:45:07,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4495 transitions. [2022-02-20 18:45:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:45:07,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:07,155 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] [2022-02-20 18:45:07,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:07,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1884301642, now seen corresponding path program 1 times [2022-02-20 18:45:07,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:07,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048822825] [2022-02-20 18:45:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:07,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {51667#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {51667#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {51667#true} assume 0 == ~r1~0 % 256; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {51667#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {51667#true} assume ~id1~0 >= 0; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {51667#true} assume 0 == ~st1~0; {51667#true} is VALID [2022-02-20 18:45:07,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {51667#true} assume ~send1~0 == ~id1~0; {51667#true} is VALID [2022-02-20 18:45:07,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {51667#true} assume 0 == ~mode1~0 % 256; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {51669#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:07,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {51669#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {51668#false} assume !(255 == ~r1~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {51668#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {51668#false} is VALID [2022-02-20 18:45:07,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {51668#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {51668#false} ~mode1~0 := 0; {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {51668#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {51668#false} assume !!(0 == ~mode2~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {51668#false} assume !!(0 == ~alive2~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {51668#false} assume !(~send2~0 != ~id2~0); {51668#false} is VALID [2022-02-20 18:45:07,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {51668#false} ~mode2~0 := 1; {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {51668#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {51668#false} assume !!(0 == ~mode3~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {51668#false} assume !!(0 == ~alive3~0 % 256); {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {51668#false} assume !(~send3~0 != ~id3~0); {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {51668#false} ~mode3~0 := 1; {51668#false} is VALID [2022-02-20 18:45:07,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {51668#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;havoc main_~check__tmp~0#1; {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {51668#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {51668#false} assume !(~r1~0 % 256 < 3); {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {51668#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {51668#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {51668#false} assume 0 == main_~assert__arg~0#1 % 256; {51668#false} is VALID [2022-02-20 18:45:07,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {51668#false} assume !false; {51668#false} is VALID [2022-02-20 18:45:07,207 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:45:07,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:07,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048822825] [2022-02-20 18:45:07,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048822825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:07,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:07,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:07,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600394182] [2022-02-20 18:45:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:07,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:07,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:07,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:07,238 INFO L87 Difference]: Start difference. First operand 3078 states and 4495 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,335 INFO L93 Difference]: Finished difference Result 6141 states and 9029 transitions. [2022-02-20 18:45:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2022-02-20 18:45:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2022-02-20 18:45:15,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 278 transitions. [2022-02-20 18:45:15,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:16,311 INFO L225 Difference]: With dead ends: 6141 [2022-02-20 18:45:16,312 INFO L226 Difference]: Without dead ends: 4298 [2022-02-20 18:45:16,314 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:45:16,320 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 264 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:45:16,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2022-02-20 18:45:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4296. [2022-02-20 18:45:23,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:23,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4298 states. Second operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:23,044 INFO L74 IsIncluded]: Start isIncluded. First operand 4298 states. Second operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:23,049 INFO L87 Difference]: Start difference. First operand 4298 states. Second operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:23,561 INFO L93 Difference]: Finished difference Result 4298 states and 6210 transitions. [2022-02-20 18:45:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 6210 transitions. [2022-02-20 18:45:23,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:23,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:23,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 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 4298 states. [2022-02-20 18:45:23,575 INFO L87 Difference]: Start difference. First operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 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 4298 states. [2022-02-20 18:45:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:24,126 INFO L93 Difference]: Finished difference Result 4298 states and 6210 transitions. [2022-02-20 18:45:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 6210 transitions. [2022-02-20 18:45:24,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:24,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:24,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:24,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6209 transitions. [2022-02-20 18:45:24,854 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6209 transitions. Word has length 43 [2022-02-20 18:45:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:24,854 INFO L470 AbstractCegarLoop]: Abstraction has 4296 states and 6209 transitions. [2022-02-20 18:45:24,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6209 transitions. [2022-02-20 18:45:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:45:24,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:24,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:24,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:45:24,856 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1507478329, now seen corresponding path program 1 times [2022-02-20 18:45:24,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:24,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793819355] [2022-02-20 18:45:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:24,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {74931#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(65, 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;~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];~__return_5979~0 := 0;~__return_6075~0 := 0; {74931#true} is VALID [2022-02-20 18:45:24,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {74931#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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__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;havoc main_~init__tmp~0#1; {74931#true} is VALID [2022-02-20 18:45:24,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {74931#true} assume 0 == ~r1~0 % 256; {74931#true} is VALID [2022-02-20 18:45:24,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {74931#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {74931#true} is VALID [2022-02-20 18:45:24,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {74931#true} assume ~id1~0 >= 0; {74931#true} is VALID [2022-02-20 18:45:24,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {74931#true} assume 0 == ~st1~0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {74933#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {74933#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {74933#(<= ~st1~0 0)} assume ~id2~0 >= 0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {74933#(<= ~st1~0 0)} assume 0 == ~st2~0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {74933#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {74933#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {74933#(<= ~st1~0 0)} assume ~id3~0 >= 0; {74933#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:24,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {74933#(<= ~st1~0 0)} assume 0 == ~st3~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {74934#(<= (+ ~st3~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;main_~main__i2~0#1 := 0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {74934#(<= (+ ~st3~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;havoc main_~check__tmp~0#1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 != ~nomsg~0; {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 > ~id2~0); {74934#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:24,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {74934#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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;havoc main_~check__tmp~0#1; {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:24,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {74935#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {74932#false} is VALID [2022-02-20 18:45:24,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {74932#false} ~__return_6075~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6075~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; {74932#false} is VALID [2022-02-20 18:45:24,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {74932#false} assume 0 == main_~assert__arg~0#1 % 256; {74932#false} is VALID [2022-02-20 18:45:24,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {74932#false} assume !false; {74932#false} is VALID [2022-02-20 18:45:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:45:24,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:24,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793819355] [2022-02-20 18:45:24,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793819355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:24,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:24,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:24,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576684239] [2022-02-20 18:45:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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:45:24,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:24,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:24,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:24,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:24,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:24,996 INFO L87 Difference]: Start difference. First operand 4296 states and 6209 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)