./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+nlh-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+nlh-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 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:30,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:30,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:30,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:30,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:30,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:30,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:30,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:30,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:30,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:30,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:30,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:30,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:30,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:30,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:30,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:30,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:30,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:30,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:30,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:30,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:30,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:30,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:30,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:30,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:30,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:30,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:30,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:30,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:30,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:30,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:30,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:30,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:30,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:30,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:30,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:30,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:30,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:30,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:30,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:30,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:30,908 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:30,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:30,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:30,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:30,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:30,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:30,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:30,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:30,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:30,934 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:30,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:30,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:30,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:30,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:30,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:30,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:30,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:30,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:30,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:30,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:30,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:30,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:30,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:30,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:30,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:30,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:30,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:30,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:30,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:30,940 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 -> 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 [2022-02-20 18:44:31,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:31,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:31,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:31,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:31,175 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:31,176 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+nlh-reducer.c [2022-02-20 18:44:31,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29075a416/a98960de2665454ba8201fe83ebbfe6e/FLAG3ec20dbf1 [2022-02-20 18:44:31,611 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:31,612 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+nlh-reducer.c [2022-02-20 18:44:31,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29075a416/a98960de2665454ba8201fe83ebbfe6e/FLAG3ec20dbf1 [2022-02-20 18:44:31,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29075a416/a98960de2665454ba8201fe83ebbfe6e [2022-02-20 18:44:31,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:31,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:31,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:31,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:31,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:31,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e764c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31, skipping insertion in model container [2022-02-20 18:44:31,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:32,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:32,223 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+nlh-reducer.c[7165,7178] [2022-02-20 18:44:32,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:32,253 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:32,298 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+nlh-reducer.c[7165,7178] [2022-02-20 18:44:32,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:32,325 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:32,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:32 WrapperNode [2022-02-20 18:44:32,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:32,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:32,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:32,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:32,331 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:32" (1/1) ... [2022-02-20 18:44:32,338 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:32" (1/1) ... [2022-02-20 18:44:32,371 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 556 [2022-02-20 18:44:32,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:32,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:32,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:32,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:32,379 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:32" (1/1) ... [2022-02-20 18:44:32,379 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:32" (1/1) ... [2022-02-20 18:44:32,383 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:32" (1/1) ... [2022-02-20 18:44:32,383 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:32" (1/1) ... [2022-02-20 18:44:32,389 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:32" (1/1) ... [2022-02-20 18:44:32,393 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:32" (1/1) ... [2022-02-20 18:44:32,394 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:32" (1/1) ... [2022-02-20 18:44:32,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:32,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:32,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:32,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:32,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:32" (1/1) ... [2022-02-20 18:44:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:32,448 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:32,478 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:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:32,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:32,558 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:32,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:33,089 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:33,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:33,099 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:33,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:33 BoogieIcfgContainer [2022-02-20 18:44:33,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:33,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:33,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:33,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:33,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:31" (1/3) ... [2022-02-20 18:44:33,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f26a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:33, skipping insertion in model container [2022-02-20 18:44:33,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:32" (2/3) ... [2022-02-20 18:44:33,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f26a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:33, skipping insertion in model container [2022-02-20 18:44:33,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:33" (3/3) ... [2022-02-20 18:44:33,108 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:44:33,113 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:33,114 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:44:33,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:33,158 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:33,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:44:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.710344827586207) internal successors, (248), 146 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call 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,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:44:33,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:33,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:33,186 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -235222256, now seen corresponding path program 1 times [2022-02-20 18:44:33,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:33,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638341732] [2022-02-20 18:44:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:33,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {150#true} is VALID [2022-02-20 18:44:33,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {150#true} is VALID [2022-02-20 18:44:33,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume 0 == ~r1~0 % 256; {150#true} is VALID [2022-02-20 18:44:33,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {150#true} is VALID [2022-02-20 18:44:33,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#true} assume ~id1~0 >= 0; {150#true} is VALID [2022-02-20 18:44:33,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 == ~st1~0; {152#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {152#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {152#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#(<= ~st1~0 0)} assume ~id2~0 >= 0; {152#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#(<= ~st1~0 0)} assume 0 == ~st2~0; {153#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {153#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {153#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {153#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {153#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {154#(<= (+ ~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; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {154#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~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~1#1; {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {154#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {151#false} is VALID [2022-02-20 18:44:33,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {151#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {151#false} is VALID [2022-02-20 18:44:33,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {151#false} assume 0 == main_~assert__arg~2#1 % 256; {151#false} is VALID [2022-02-20 18:44:33,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 18:44:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:33,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:33,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638341732] [2022-02-20 18:44:33,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638341732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:33,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:33,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:33,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939867671] [2022-02-20 18:44:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:44:33,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:33,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:33,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:33,568 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.710344827586207) internal successors, (248), 146 states have internal predecessors, (248), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:34,434 INFO L93 Difference]: Finished difference Result 467 states and 755 transitions. [2022-02-20 18:44:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:34,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:44:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2022-02-20 18:44:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2022-02-20 18:44:34,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 755 transitions. [2022-02-20 18:44:34,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:34,958 INFO L225 Difference]: With dead ends: 467 [2022-02-20 18:44:34,958 INFO L226 Difference]: Without dead ends: 393 [2022-02-20 18:44:34,961 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:34,963 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 824 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:34,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 865 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-02-20 18:44:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 231. [2022-02-20 18:44:35,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:35,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call 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,042 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call 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,042 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call 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,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,057 INFO L93 Difference]: Finished difference Result 393 states and 600 transitions. [2022-02-20 18:44:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 600 transitions. [2022-02-20 18:44:35,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 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 393 states. [2022-02-20 18:44:35,060 INFO L87 Difference]: Start difference. First operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 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 393 states. [2022-02-20 18:44:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,079 INFO L93 Difference]: Finished difference Result 393 states and 600 transitions. [2022-02-20 18:44:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 600 transitions. [2022-02-20 18:44:35,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:35,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call 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,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-02-20 18:44:35,089 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 48 [2022-02-20 18:44:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:35,090 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-02-20 18:44:35,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-02-20 18:44:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:35,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:35,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:35,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:35,091 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash 407331856, now seen corresponding path program 1 times [2022-02-20 18:44:35,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:35,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211796203] [2022-02-20 18:44:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:35,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1866#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {1866#true} is VALID [2022-02-20 18:44:35,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1866#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {1866#true} assume 0 == ~r1~0 % 256; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {1866#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {1866#true} assume ~id1~0 >= 0; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1866#true} assume 0 == ~st1~0; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {1866#true} assume ~send1~0 == ~id1~0; {1866#true} is VALID [2022-02-20 18:44:35,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1866#true} assume 0 == ~mode1~0 % 256; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1866#true} assume ~id2~0 >= 0; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {1866#true} assume 0 == ~st2~0; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {1866#true} assume ~send2~0 == ~id2~0; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#true} assume 0 == ~mode2~0 % 256; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {1866#true} assume ~id3~0 >= 0; {1866#true} is VALID [2022-02-20 18:44:35,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#true} assume 0 == ~st3~0; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1866#true} assume ~send3~0 == ~id3~0; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {1866#true} assume 0 == ~mode3~0 % 256; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {1866#true} assume ~id1~0 != ~id2~0; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {1866#true} assume ~id1~0 != ~id3~0; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {1866#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; {1866#true} is VALID [2022-02-20 18:44:35,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {1866#true} 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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1866#true} is VALID [2022-02-20 18:44:35,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {1866#true} assume !!(0 == ~mode1~0 % 256); {1866#true} is VALID [2022-02-20 18:44:35,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {1866#true} assume !!(0 == ~alive1~0 % 256); {1866#true} is VALID [2022-02-20 18:44:35,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {1866#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1866#true} is VALID [2022-02-20 18:44:35,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {1866#true} assume !!(0 == ~mode2~0 % 256); {1866#true} is VALID [2022-02-20 18:44:35,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {1866#true} assume !!(0 == ~alive2~0 % 256); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:35,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {1868#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {1867#false} is VALID [2022-02-20 18:44:35,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {1867#false} assume !(main_~node2__m2~1#1 > ~id2~0); {1867#false} is VALID [2022-02-20 18:44:35,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {1867#false} is VALID [2022-02-20 18:44:35,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {1867#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {1867#false} is VALID [2022-02-20 18:44:35,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {1867#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1867#false} is VALID [2022-02-20 18:44:35,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {1867#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {1867#false} is VALID [2022-02-20 18:44:35,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {1867#false} ~mode3~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~1#1; {1867#false} is VALID [2022-02-20 18:44:35,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {1867#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {1867#false} is VALID [2022-02-20 18:44:35,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {1867#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {1867#false} is VALID [2022-02-20 18:44:35,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {1867#false} assume 0 == main_~assert__arg~2#1 % 256; {1867#false} is VALID [2022-02-20 18:44:35,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2022-02-20 18:44:35,169 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,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:35,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211796203] [2022-02-20 18:44:35,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211796203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:35,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:35,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:35,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600893839] [2022-02-20 18:44:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:35,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:35,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:35,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:35,203 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,528 INFO L93 Difference]: Finished difference Result 569 states and 875 transitions. [2022-02-20 18:44:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2022-02-20 18:44:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2022-02-20 18:44:35,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 492 transitions. [2022-02-20 18:44:35,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,806 INFO L225 Difference]: With dead ends: 569 [2022-02-20 18:44:35,806 INFO L226 Difference]: Without dead ends: 401 [2022-02-20 18:44:35,810 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:35,812 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:35,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 392 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-02-20 18:44:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2022-02-20 18:44:35,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:35,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call 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,936 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call 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,937 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call 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,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,948 INFO L93 Difference]: Finished difference Result 401 states and 603 transitions. [2022-02-20 18:44:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 603 transitions. [2022-02-20 18:44:35,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 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 401 states. [2022-02-20 18:44:35,951 INFO L87 Difference]: Start difference. First operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 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 401 states. [2022-02-20 18:44:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,963 INFO L93 Difference]: Finished difference Result 401 states and 603 transitions. [2022-02-20 18:44:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 603 transitions. [2022-02-20 18:44:35,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:35,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:35,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:35,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call 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,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2022-02-20 18:44:35,989 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 51 [2022-02-20 18:44:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:35,991 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2022-02-20 18:44:35,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2022-02-20 18:44:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:35,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:35,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:35,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:35,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:35,994 INFO L85 PathProgramCache]: Analyzing trace with hash 738781713, now seen corresponding path program 1 times [2022-02-20 18:44:35,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:35,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532641022] [2022-02-20 18:44:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:36,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {3947#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {3947#true} is VALID [2022-02-20 18:44:36,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {3947#true} is VALID [2022-02-20 18:44:36,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#true} assume 0 == ~r1~0 % 256; {3947#true} is VALID [2022-02-20 18:44:36,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {3947#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3947#true} is VALID [2022-02-20 18:44:36,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {3947#true} assume ~id1~0 >= 0; {3947#true} is VALID [2022-02-20 18:44:36,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {3947#true} assume 0 == ~st1~0; {3947#true} is VALID [2022-02-20 18:44:36,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {3947#true} assume ~send1~0 == ~id1~0; {3947#true} is VALID [2022-02-20 18:44:36,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {3947#true} assume 0 == ~mode1~0 % 256; {3947#true} is VALID [2022-02-20 18:44:36,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {3947#true} assume ~id2~0 >= 0; {3947#true} is VALID [2022-02-20 18:44:36,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {3947#true} assume 0 == ~st2~0; {3947#true} is VALID [2022-02-20 18:44:36,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {3947#true} assume ~send2~0 == ~id2~0; {3947#true} is VALID [2022-02-20 18:44:36,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {3947#true} assume 0 == ~mode2~0 % 256; {3947#true} is VALID [2022-02-20 18:44:36,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {3947#true} assume ~id3~0 >= 0; {3947#true} is VALID [2022-02-20 18:44:36,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {3947#true} assume 0 == ~st3~0; {3947#true} is VALID [2022-02-20 18:44:36,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {3947#true} assume ~send3~0 == ~id3~0; {3947#true} is VALID [2022-02-20 18:44:36,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {3947#true} assume 0 == ~mode3~0 % 256; {3947#true} is VALID [2022-02-20 18:44:36,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {3947#true} assume ~id1~0 != ~id2~0; {3947#true} is VALID [2022-02-20 18:44:36,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {3947#true} assume ~id1~0 != ~id3~0; {3947#true} is VALID [2022-02-20 18:44:36,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {3947#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; {3947#true} is VALID [2022-02-20 18:44:36,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {3947#true} 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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3947#true} is VALID [2022-02-20 18:44:36,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {3947#true} assume !!(0 == ~mode1~0 % 256); {3947#true} is VALID [2022-02-20 18:44:36,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {3947#true} assume !!(0 == ~alive1~0 % 256); {3947#true} is VALID [2022-02-20 18:44:36,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {3947#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3947#true} is VALID [2022-02-20 18:44:36,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {3947#true} assume !!(0 == ~mode2~0 % 256); {3947#true} is VALID [2022-02-20 18:44:36,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {3947#true} assume !!(0 == ~alive2~0 % 256); {3947#true} is VALID [2022-02-20 18:44:36,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {3947#true} assume !(~send2~0 != ~id2~0); {3947#true} is VALID [2022-02-20 18:44:36,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {3947#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3947#true} is VALID [2022-02-20 18:44:36,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {3947#true} assume !!(0 == ~mode3~0 % 256); {3947#true} is VALID [2022-02-20 18:44:36,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {3947#true} assume !!(0 == ~alive3~0 % 256); {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256); {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:36,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {3949#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {3948#false} is VALID [2022-02-20 18:44:36,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {3948#false} assume !(main_~node3__m3~1#1 > ~id3~0); {3948#false} is VALID [2022-02-20 18:44:36,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {3948#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3948#false} is VALID [2022-02-20 18:44:36,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {3948#false} ~mode3~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~1#1; {3948#false} is VALID [2022-02-20 18:44:36,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {3948#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {3948#false} is VALID [2022-02-20 18:44:36,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {3948#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {3948#false} is VALID [2022-02-20 18:44:36,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {3948#false} assume 0 == main_~assert__arg~2#1 % 256; {3948#false} is VALID [2022-02-20 18:44:36,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {3948#false} assume !false; {3948#false} is VALID [2022-02-20 18:44:36,133 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:36,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:36,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532641022] [2022-02-20 18:44:36,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532641022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:36,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:36,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:36,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469994628] [2022-02-20 18:44:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:36,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:36,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:36,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:36,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:36,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:36,181 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,611 INFO L93 Difference]: Finished difference Result 979 states and 1498 transitions. [2022-02-20 18:44:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2022-02-20 18:44:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2022-02-20 18:44:36,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 468 transitions. [2022-02-20 18:44:36,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:36,954 INFO L225 Difference]: With dead ends: 979 [2022-02-20 18:44:36,954 INFO L226 Difference]: Without dead ends: 691 [2022-02-20 18:44:36,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:36,958 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 130 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:36,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 392 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-02-20 18:44:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-02-20 18:44:37,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:37,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call 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,141 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call 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,142 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call 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,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,158 INFO L93 Difference]: Finished difference Result 691 states and 1035 transitions. [2022-02-20 18:44:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1035 transitions. [2022-02-20 18:44:37,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 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 691 states. [2022-02-20 18:44:37,161 INFO L87 Difference]: Start difference. First operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 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 691 states. [2022-02-20 18:44:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,177 INFO L93 Difference]: Finished difference Result 691 states and 1035 transitions. [2022-02-20 18:44:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1035 transitions. [2022-02-20 18:44:37,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:37,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call 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,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1034 transitions. [2022-02-20 18:44:37,198 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1034 transitions. Word has length 51 [2022-02-20 18:44:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:37,199 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 1034 transitions. [2022-02-20 18:44:37,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1034 transitions. [2022-02-20 18:44:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:37,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:37,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:37,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:37,200 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -865520847, now seen corresponding path program 1 times [2022-02-20 18:44:37,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:37,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062442752] [2022-02-20 18:44:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:37,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {7550#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {7550#true} is VALID [2022-02-20 18:44:37,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {7550#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {7550#true} assume 0 == ~r1~0 % 256; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {7550#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {7550#true} assume ~id1~0 >= 0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {7550#true} assume 0 == ~st1~0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {7550#true} assume ~send1~0 == ~id1~0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {7550#true} assume 0 == ~mode1~0 % 256; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {7550#true} assume ~id2~0 >= 0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {7550#true} assume 0 == ~st2~0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {7550#true} assume ~send2~0 == ~id2~0; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {7550#true} assume 0 == ~mode2~0 % 256; {7550#true} is VALID [2022-02-20 18:44:37,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {7550#true} assume ~id3~0 >= 0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {7550#true} assume 0 == ~st3~0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {7550#true} assume ~send3~0 == ~id3~0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {7550#true} assume 0 == ~mode3~0 % 256; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {7550#true} assume ~id1~0 != ~id2~0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {7550#true} assume ~id1~0 != ~id3~0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {7550#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; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {7550#true} 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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7550#true} is VALID [2022-02-20 18:44:37,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {7550#true} assume !!(0 == ~mode1~0 % 256); {7550#true} is VALID [2022-02-20 18:44:37,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {7550#true} assume !!(0 == ~alive1~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256); {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:37,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {7552#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {7551#false} is VALID [2022-02-20 18:44:37,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {7551#false} assume !(main_~node1__m1~1#1 > ~id1~0); {7551#false} is VALID [2022-02-20 18:44:37,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {7551#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {7551#false} is VALID [2022-02-20 18:44:37,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {7551#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {7551#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {7551#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {7551#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {7551#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {7551#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {7551#false} ~mode3~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~1#1; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {7551#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {7551#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {7551#false} assume 0 == main_~assert__arg~2#1 % 256; {7551#false} is VALID [2022-02-20 18:44:37,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {7551#false} assume !false; {7551#false} is VALID [2022-02-20 18:44:37,253 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,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:37,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062442752] [2022-02-20 18:44:37,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062442752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:37,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:37,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:37,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441516302] [2022-02-20 18:44:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:37,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:37,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:37,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:37,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:37,300 INFO L87 Difference]: Start difference. First operand 689 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,942 INFO L93 Difference]: Finished difference Result 1811 states and 2729 transitions. [2022-02-20 18:44:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2022-02-20 18:44:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2022-02-20 18:44:37,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 514 transitions. [2022-02-20 18:44:38,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:38,308 INFO L225 Difference]: With dead ends: 1811 [2022-02-20 18:44:38,308 INFO L226 Difference]: Without dead ends: 1209 [2022-02-20 18:44:38,309 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:38,310 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:38,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-02-20 18:44:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1207. [2022-02-20 18:44:38,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:38,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1209 states. Second operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call 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:38,637 INFO L74 IsIncluded]: Start isIncluded. First operand 1209 states. Second operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call 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:38,639 INFO L87 Difference]: Start difference. First operand 1209 states. Second operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call 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:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,682 INFO L93 Difference]: Finished difference Result 1209 states and 1770 transitions. [2022-02-20 18:44:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1770 transitions. [2022-02-20 18:44:38,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:38,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:38,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 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 1209 states. [2022-02-20 18:44:38,687 INFO L87 Difference]: Start difference. First operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 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 1209 states. [2022-02-20 18:44:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,731 INFO L93 Difference]: Finished difference Result 1209 states and 1770 transitions. [2022-02-20 18:44:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1770 transitions. [2022-02-20 18:44:38,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:38,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:38,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:38,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call 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:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1769 transitions. [2022-02-20 18:44:38,792 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1769 transitions. Word has length 51 [2022-02-20 18:44:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:38,793 INFO L470 AbstractCegarLoop]: Abstraction has 1207 states and 1769 transitions. [2022-02-20 18:44:38,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1769 transitions. [2022-02-20 18:44:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:38,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:38,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:38,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:38,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1376619607, now seen corresponding path program 1 times [2022-02-20 18:44:38,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:38,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010651086] [2022-02-20 18:44:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:38,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:38,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {14005#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {14005#true} is VALID [2022-02-20 18:44:38,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {14005#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {14005#true} is VALID [2022-02-20 18:44:38,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {14005#true} assume 0 == ~r1~0 % 256; {14005#true} is VALID [2022-02-20 18:44:38,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {14005#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {14005#true} is VALID [2022-02-20 18:44:38,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {14005#true} assume ~id1~0 >= 0; {14005#true} is VALID [2022-02-20 18:44:38,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {14005#true} assume 0 == ~st1~0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {14007#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {14007#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {14007#(<= ~st1~0 0)} assume ~id2~0 >= 0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {14007#(<= ~st1~0 0)} assume 0 == ~st2~0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {14007#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {14007#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {14007#(<= ~st1~0 0)} assume ~id3~0 >= 0; {14007#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:38,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {14007#(<= ~st1~0 0)} assume 0 == ~st3~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {14008#(<= (+ ~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; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {14008#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {14008#(<= (+ ~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); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {14008#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:38,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {14008#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:38,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:38,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:38,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:38,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~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~1#1; {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:38,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {14009#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {14006#false} is VALID [2022-02-20 18:44:38,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {14006#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {14006#false} is VALID [2022-02-20 18:44:38,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {14006#false} assume 0 == main_~assert__arg~2#1 % 256; {14006#false} is VALID [2022-02-20 18:44:38,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {14006#false} assume !false; {14006#false} is VALID [2022-02-20 18:44:38,896 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:38,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:38,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010651086] [2022-02-20 18:44:38,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010651086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:38,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:38,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:38,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469876798] [2022-02-20 18:44:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:38,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:38,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:38,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:38,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:38,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:38,923 INFO L87 Difference]: Start difference. First operand 1207 states and 1769 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:40,261 INFO L93 Difference]: Finished difference Result 2347 states and 3506 transitions. [2022-02-20 18:44:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:40,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 693 transitions. [2022-02-20 18:44:40,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:40,843 INFO L225 Difference]: With dead ends: 2347 [2022-02-20 18:44:40,843 INFO L226 Difference]: Without dead ends: 2001 [2022-02-20 18:44:40,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:40,847 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 563 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:40,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 894 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2022-02-20 18:44:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1611. [2022-02-20 18:44:41,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:41,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2001 states. Second operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call 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:41,530 INFO L74 IsIncluded]: Start isIncluded. First operand 2001 states. Second operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call 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:41,532 INFO L87 Difference]: Start difference. First operand 2001 states. Second operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call 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:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:41,646 INFO L93 Difference]: Finished difference Result 2001 states and 2965 transitions. [2022-02-20 18:44:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2965 transitions. [2022-02-20 18:44:41,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:41,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:41,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 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 2001 states. [2022-02-20 18:44:41,653 INFO L87 Difference]: Start difference. First operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 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 2001 states. [2022-02-20 18:44:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:41,768 INFO L93 Difference]: Finished difference Result 2001 states and 2965 transitions. [2022-02-20 18:44:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2965 transitions. [2022-02-20 18:44:41,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:41,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:41,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:41,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call 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:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2374 transitions. [2022-02-20 18:44:41,953 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2374 transitions. Word has length 52 [2022-02-20 18:44:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:41,954 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2374 transitions. [2022-02-20 18:44:41,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2374 transitions. [2022-02-20 18:44:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:41,955 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:41,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:41,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:41,956 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1542318405, now seen corresponding path program 1 times [2022-02-20 18:44:41,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:41,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123612344] [2022-02-20 18:44:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:42,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {23383#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {23383#true} is VALID [2022-02-20 18:44:42,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {23383#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {23383#true} is VALID [2022-02-20 18:44:42,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {23383#true} assume 0 == ~r1~0 % 256; {23383#true} is VALID [2022-02-20 18:44:42,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {23383#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {23383#true} is VALID [2022-02-20 18:44:42,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {23383#true} assume ~id1~0 >= 0; {23383#true} is VALID [2022-02-20 18:44:42,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {23383#true} assume 0 == ~st1~0; {23385#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:42,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {23385#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {23385#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:42,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {23385#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {23385#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:42,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {23385#(<= ~st1~0 0)} assume ~id2~0 >= 0; {23385#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:42,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {23385#(<= ~st1~0 0)} assume 0 == ~st2~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {23386#(<= (+ ~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; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {23386#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {23386#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:42,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {23386#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {23387#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:42,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {23387#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~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~1#1; {23387#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:42,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {23387#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {23384#false} is VALID [2022-02-20 18:44:42,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {23384#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {23384#false} is VALID [2022-02-20 18:44:42,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {23384#false} assume 0 == main_~assert__arg~2#1 % 256; {23384#false} is VALID [2022-02-20 18:44:42,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {23384#false} assume !false; {23384#false} is VALID [2022-02-20 18:44:42,060 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:42,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:42,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123612344] [2022-02-20 18:44:42,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123612344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:42,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:42,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:42,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179625295] [2022-02-20 18:44:42,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:42,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:42,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:42,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:42,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:42,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:42,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:42,103 INFO L87 Difference]: Start difference. First operand 1611 states and 2374 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,767 INFO L93 Difference]: Finished difference Result 2721 states and 4066 transitions. [2022-02-20 18:44:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:43,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 693 transitions. [2022-02-20 18:44:44,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:44,389 INFO L225 Difference]: With dead ends: 2721 [2022-02-20 18:44:44,389 INFO L226 Difference]: Without dead ends: 2375 [2022-02-20 18:44:44,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:44,391 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 567 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:44,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 928 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2022-02-20 18:44:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1921. [2022-02-20 18:44:45,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:45,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2375 states. Second operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call 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:45,200 INFO L74 IsIncluded]: Start isIncluded. First operand 2375 states. Second operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call 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:45,201 INFO L87 Difference]: Start difference. First operand 2375 states. Second operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call 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:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:45,360 INFO L93 Difference]: Finished difference Result 2375 states and 3525 transitions. [2022-02-20 18:44:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3525 transitions. [2022-02-20 18:44:45,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:45,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:45,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 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 2375 states. [2022-02-20 18:44:45,372 INFO L87 Difference]: Start difference. First operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 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 2375 states. [2022-02-20 18:44:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:45,527 INFO L93 Difference]: Finished difference Result 2375 states and 3525 transitions. [2022-02-20 18:44:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3525 transitions. [2022-02-20 18:44:45,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:45,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:45,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:45,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call 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:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2842 transitions. [2022-02-20 18:44:45,676 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2842 transitions. Word has length 52 [2022-02-20 18:44:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:45,676 INFO L470 AbstractCegarLoop]: Abstraction has 1921 states and 2842 transitions. [2022-02-20 18:44:45,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2842 transitions. [2022-02-20 18:44:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:45,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:45,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:45,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:45,678 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1268142435, now seen corresponding path program 1 times [2022-02-20 18:44:45,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:45,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111600645] [2022-02-20 18:44:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:45,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {34459#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {34459#true} is VALID [2022-02-20 18:44:45,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {34459#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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {34459#true} is VALID [2022-02-20 18:44:45,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {34459#true} assume 0 == ~r1~0 % 256; {34459#true} is VALID [2022-02-20 18:44:45,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {34459#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {34459#true} is VALID [2022-02-20 18:44:45,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {34459#true} assume ~id1~0 >= 0; {34459#true} is VALID [2022-02-20 18:44:45,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {34459#true} assume 0 == ~st1~0; {34459#true} is VALID [2022-02-20 18:44:45,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {34459#true} assume ~send1~0 == ~id1~0; {34459#true} is VALID [2022-02-20 18:44:45,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {34459#true} assume 0 == ~mode1~0 % 256; {34459#true} is VALID [2022-02-20 18:44:45,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {34459#true} assume ~id2~0 >= 0; {34459#true} is VALID [2022-02-20 18:44:45,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {34459#true} assume 0 == ~st2~0; {34461#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:45,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {34461#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {34461#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:45,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {34461#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {34461#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:45,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {34461#(<= ~st2~0 0)} assume ~id3~0 >= 0; {34461#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:45,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {34461#(<= ~st2~0 0)} assume 0 == ~st3~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {34462#(<= (+ ~st3~0 ~st2~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; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {34462#(<= (+ ~st3~0 ~st2~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {34462#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:45,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {34462#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~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~1#1; {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:45,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {34463#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {34460#false} is VALID [2022-02-20 18:44:45,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {34460#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {34460#false} is VALID [2022-02-20 18:44:45,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {34460#false} assume 0 == main_~assert__arg~2#1 % 256; {34460#false} is VALID [2022-02-20 18:44:45,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {34460#false} assume !false; {34460#false} is VALID [2022-02-20 18:44:45,742 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:45,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:45,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111600645] [2022-02-20 18:44:45,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111600645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:45,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:45,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:45,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512967839] [2022-02-20 18:44:45,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:45,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:45,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:45,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:45,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:45,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:45,788 INFO L87 Difference]: Start difference. First operand 1921 states and 2842 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:47,972 INFO L93 Difference]: Finished difference Result 3135 states and 4687 transitions. [2022-02-20 18:44:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-02-20 18:44:47,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 693 transitions. [2022-02-20 18:44:48,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:48,702 INFO L225 Difference]: With dead ends: 3135 [2022-02-20 18:44:48,702 INFO L226 Difference]: Without dead ends: 2789 [2022-02-20 18:44:48,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:48,703 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 574 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:48,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 942 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2022-02-20 18:44:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2216. [2022-02-20 18:44:49,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:49,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2789 states. Second operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call 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,755 INFO L74 IsIncluded]: Start isIncluded. First operand 2789 states. Second operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call 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,772 INFO L87 Difference]: Start difference. First operand 2789 states. Second operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call 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,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:49,994 INFO L93 Difference]: Finished difference Result 2789 states and 4146 transitions. [2022-02-20 18:44:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4146 transitions. [2022-02-20 18:44:49,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:49,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:50,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 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 2789 states. [2022-02-20 18:44:50,002 INFO L87 Difference]: Start difference. First operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 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 2789 states. [2022-02-20 18:44:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:50,210 INFO L93 Difference]: Finished difference Result 2789 states and 4146 transitions. [2022-02-20 18:44:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4146 transitions. [2022-02-20 18:44:50,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:50,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:50,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:50,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call 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:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3290 transitions. [2022-02-20 18:44:50,415 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3290 transitions. Word has length 53 [2022-02-20 18:44:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:50,415 INFO L470 AbstractCegarLoop]: Abstraction has 2216 states and 3290 transitions. [2022-02-20 18:44:50,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3290 transitions. [2022-02-20 18:44:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:44:50,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:50,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:50,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:50,417 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1868949312, now seen corresponding path program 1 times [2022-02-20 18:44:50,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:50,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014590756] [2022-02-20 18:44:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:50,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {47348#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {47350#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {47350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:50,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {47350#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {47351#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:50,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {47351#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {47351#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:50,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {47351#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~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; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {47352#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {47352#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {47349#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {47349#false} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {47349#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {47349#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {47349#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {47349#false} assume !(0 == ~mode1~0 % 256); {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {47349#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {47349#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {47349#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {47349#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {47349#false} assume main_~node2__m2~1#1 != ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {47349#false} assume !(0 == ~alive2~0 % 256); {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {47349#false} assume !(main_~node2__m2~1#1 > ~id2~0); {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {47349#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {47349#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {47349#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {47349#false} assume main_~node3__m3~1#1 != ~nomsg~0; {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {47349#false} assume !(0 == ~alive3~0 % 256); {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {47349#false} assume !(main_~node3__m3~1#1 > ~id3~0); {47349#false} is VALID [2022-02-20 18:44:50,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {47349#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {47349#false} is VALID [2022-02-20 18:44:50,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {47349#false} ~mode3~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~1#1; {47349#false} is VALID [2022-02-20 18:44:50,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {47349#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {47349#false} is VALID [2022-02-20 18:44:50,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {47349#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {47349#false} is VALID [2022-02-20 18:44:50,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {47349#false} assume 0 == main_~assert__arg~2#1 % 256; {47349#false} is VALID [2022-02-20 18:44:50,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {47349#false} assume !false; {47349#false} is VALID [2022-02-20 18:44:50,490 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:50,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:50,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014590756] [2022-02-20 18:44:50,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014590756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:50,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:50,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:50,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150645730] [2022-02-20 18:44:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 56 [2022-02-20 18:44:50,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:50,491 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), 4 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:44:50,530 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:44:50,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:50,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:50,531 INFO L87 Difference]: Start difference. First operand 2216 states and 3290 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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:44:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:55,173 INFO L93 Difference]: Finished difference Result 5194 states and 7716 transitions. [2022-02-20 18:44:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:55,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 56 [2022-02-20 18:44:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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:44:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-02-20 18:44:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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:44:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-02-20 18:44:55,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-02-20 18:44:55,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:55,867 INFO L225 Difference]: With dead ends: 5194 [2022-02-20 18:44:55,868 INFO L226 Difference]: Without dead ends: 3055 [2022-02-20 18:44:55,870 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:55,870 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 770 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:55,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 213 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2022-02-20 18:44:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3037. [2022-02-20 18:44:58,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:58,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3055 states. Second operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call 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:58,635 INFO L74 IsIncluded]: Start isIncluded. First operand 3055 states. Second operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call 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:58,638 INFO L87 Difference]: Start difference. First operand 3055 states. Second operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call 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:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:58,910 INFO L93 Difference]: Finished difference Result 3055 states and 4486 transitions. [2022-02-20 18:44:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4486 transitions. [2022-02-20 18:44:58,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:58,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:58,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 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 3055 states. [2022-02-20 18:44:58,918 INFO L87 Difference]: Start difference. First operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 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 3055 states. [2022-02-20 18:44:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:59,203 INFO L93 Difference]: Finished difference Result 3055 states and 4486 transitions. [2022-02-20 18:44:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4486 transitions. [2022-02-20 18:44:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:59,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:59,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call 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:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4469 transitions. [2022-02-20 18:44:59,573 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4469 transitions. Word has length 56 [2022-02-20 18:44:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:59,573 INFO L470 AbstractCegarLoop]: Abstraction has 3037 states and 4469 transitions. [2022-02-20 18:44:59,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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:44:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4469 transitions. [2022-02-20 18:44:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:44:59,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:59,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:59,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:59,575 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -281542782, now seen corresponding path program 1 times [2022-02-20 18:44:59,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:59,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000010942] [2022-02-20 18:44:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:59,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {64724#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {64726#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:59,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {64726#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {64726#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:59,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {64726#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {64726#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:59,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {64726#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {64726#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:59,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {64726#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {64727#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:59,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {64727#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {64727#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:59,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {64727#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~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; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {64728#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:59,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {64728#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {64725#false} is VALID [2022-02-20 18:44:59,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {64725#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {64725#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {64725#false} assume !!(0 == ~mode2~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {64725#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {64725#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {64725#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); {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {64725#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {64725#false} assume !!(0 == ~mode3~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {64725#false} assume !!(0 == ~alive3~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {64725#false} assume !(~send3~0 != ~id3~0); {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {64725#false} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {64725#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {64725#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {64725#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {64725#false} assume !(0 == ~mode1~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {64725#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {64725#false} assume main_~node1__m1~1#1 != ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {64725#false} assume !(0 == ~alive1~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {64725#false} assume !(main_~node1__m1~1#1 > ~id1~0); {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {64725#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {64725#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {64725#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {64725#false} assume main_~node2__m2~1#1 != ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {64725#false} assume !(0 == ~alive2~0 % 256); {64725#false} is VALID [2022-02-20 18:44:59,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {64725#false} assume !(main_~node2__m2~1#1 > ~id2~0); {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {64725#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {64725#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 50: Hoare triple {64725#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 51: Hoare triple {64725#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {64725#false} ~mode3~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~1#1; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {64725#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {64725#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {64725#false} is VALID [2022-02-20 18:44:59,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {64725#false} assume 0 == main_~assert__arg~2#1 % 256; {64725#false} is VALID [2022-02-20 18:44:59,669 INFO L290 TraceCheckUtils]: 56: Hoare triple {64725#false} assume !false; {64725#false} is VALID [2022-02-20 18:44:59,669 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:59,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:59,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000010942] [2022-02-20 18:44:59,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000010942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:59,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:59,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:59,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327894606] [2022-02-20 18:44:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:59,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:59,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:59,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:59,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:59,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:59,705 INFO L87 Difference]: Start difference. First operand 3037 states and 4469 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,819 INFO L93 Difference]: Finished difference Result 7096 states and 10425 transitions. [2022-02-20 18:45:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:45:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2022-02-20 18:45:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2022-02-20 18:45:07,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 504 transitions. [2022-02-20 18:45:08,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:08,848 INFO L225 Difference]: With dead ends: 7096 [2022-02-20 18:45:08,849 INFO L226 Difference]: Without dead ends: 4145 [2022-02-20 18:45:08,852 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:45:08,853 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 800 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:08,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 201 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2022-02-20 18:45:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3037. [2022-02-20 18:45:13,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:13,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4145 states. Second operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:13,078 INFO L74 IsIncluded]: Start isIncluded. First operand 4145 states. Second operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:13,079 INFO L87 Difference]: Start difference. First operand 4145 states. Second operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:13,567 INFO L93 Difference]: Finished difference Result 4145 states and 6006 transitions. [2022-02-20 18:45:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6006 transitions. [2022-02-20 18:45:13,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:13,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 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 4145 states. [2022-02-20 18:45:13,576 INFO L87 Difference]: Start difference. First operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 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 4145 states. [2022-02-20 18:45:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,069 INFO L93 Difference]: Finished difference Result 4145 states and 6006 transitions. [2022-02-20 18:45:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6006 transitions. [2022-02-20 18:45:14,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:14,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:14,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:14,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4419 transitions. [2022-02-20 18:45:14,478 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4419 transitions. Word has length 57 [2022-02-20 18:45:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:14,478 INFO L470 AbstractCegarLoop]: Abstraction has 3037 states and 4419 transitions. [2022-02-20 18:45:14,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4419 transitions. [2022-02-20 18:45:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:45:14,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:14,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:14,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:45:14,480 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1520651092, now seen corresponding path program 1 times [2022-02-20 18:45:14,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:14,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524745934] [2022-02-20 18:45:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:14,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {86934#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {86936#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {86936#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {86936#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {86937#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:14,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {86937#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {86937#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:14,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {86937#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {86938#(<= (+ ~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; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {86938#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {86938#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:14,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {86938#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {86935#false} is VALID [2022-02-20 18:45:14,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {86935#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); {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {86935#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {86935#false} assume !!(0 == ~mode3~0 % 256); {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {86935#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {86935#false} assume ~send3~0 != ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {86935#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {86935#false} is VALID [2022-02-20 18:45:14,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {86935#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {86935#false} is VALID [2022-02-20 18:45:14,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {86935#false} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {86935#false} is VALID [2022-02-20 18:45:14,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {86935#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {86935#false} is VALID [2022-02-20 18:45:14,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {86935#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {86935#false} is VALID [2022-02-20 18:45:14,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {86935#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {86935#false} assume !(0 == ~mode1~0 % 256); {86935#false} is VALID [2022-02-20 18:45:14,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {86935#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {86935#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {86935#false} is VALID [2022-02-20 18:45:14,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {86935#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {86935#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {86935#false} assume main_~node2__m2~1#1 != ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {86935#false} assume !(0 == ~alive2~0 % 256); {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {86935#false} assume !(main_~node2__m2~1#1 > ~id2~0); {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {86935#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {86935#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {86935#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {86935#false} assume main_~node3__m3~1#1 != ~nomsg~0; {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {86935#false} assume !(0 == ~alive3~0 % 256); {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {86935#false} assume !(main_~node3__m3~1#1 > ~id3~0); {86935#false} is VALID [2022-02-20 18:45:14,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {86935#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {86935#false} is VALID [2022-02-20 18:45:14,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {86935#false} ~mode3~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~1#1; {86935#false} is VALID [2022-02-20 18:45:14,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {86935#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {86935#false} is VALID [2022-02-20 18:45:14,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {86935#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {86935#false} is VALID [2022-02-20 18:45:14,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {86935#false} assume 0 == main_~assert__arg~2#1 % 256; {86935#false} is VALID [2022-02-20 18:45:14,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {86935#false} assume !false; {86935#false} is VALID [2022-02-20 18:45:14,577 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:14,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:14,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524745934] [2022-02-20 18:45:14,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524745934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:14,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:14,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:14,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246878787] [2022-02-20 18:45:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:45:14,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:14,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:14,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:14,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:14,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:14,613 INFO L87 Difference]: Start difference. First operand 3037 states and 4419 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:23,032 INFO L93 Difference]: Finished difference Result 7242 states and 10532 transitions. [2022-02-20 18:45:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:45:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2022-02-20 18:45:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2022-02-20 18:45:23,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 486 transitions. [2022-02-20 18:45:23,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:24,081 INFO L225 Difference]: With dead ends: 7242 [2022-02-20 18:45:24,081 INFO L226 Difference]: Without dead ends: 4246 [2022-02-20 18:45:24,084 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:45:24,084 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 779 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:24,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 211 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2022-02-20 18:45:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 4221. [2022-02-20 18:45:29,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:29,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4246 states. Second operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call 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:29,450 INFO L74 IsIncluded]: Start isIncluded. First operand 4246 states. Second operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call 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:29,453 INFO L87 Difference]: Start difference. First operand 4246 states. Second operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call 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:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:29,957 INFO L93 Difference]: Finished difference Result 4246 states and 6108 transitions. [2022-02-20 18:45:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6108 transitions. [2022-02-20 18:45:29,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:29,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:29,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 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 4246 states. [2022-02-20 18:45:29,969 INFO L87 Difference]: Start difference. First operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 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 4246 states. [2022-02-20 18:45:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:30,477 INFO L93 Difference]: Finished difference Result 4246 states and 6108 transitions. [2022-02-20 18:45:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6108 transitions. [2022-02-20 18:45:30,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:30,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:30,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:30,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call 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:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 6084 transitions. [2022-02-20 18:45:31,222 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 6084 transitions. Word has length 57 [2022-02-20 18:45:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:31,223 INFO L470 AbstractCegarLoop]: Abstraction has 4221 states and 6084 transitions. [2022-02-20 18:45:31,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 6084 transitions. [2022-02-20 18:45:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:45:31,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:31,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:31,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:45:31,225 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1438328999, now seen corresponding path program 1 times [2022-02-20 18:45:31,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:31,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207439009] [2022-02-20 18:45:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:31,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {111204#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_6056~0 := 0;~__return_6117~0 := 0;~__return_6183~0 := 0;~__return_6353~0 := 0; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {111206#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {111206#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:31,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {111206#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode2~0 % 256; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id3~0 >= 0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st3~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send3~0 == ~id3~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode3~0 % 256; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id2~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id3~0; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~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; {111207#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {111207#(<= (+ ~nomsg~0 1) ~id2~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode1~0 % 256); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~alive1~0 % 256); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode2~0 % 256); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send2~0 != ~nomsg~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~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); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode3~0 % 256); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send3~0 != ~nomsg~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {111208#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {111208#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6056~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6056~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; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode1~0 % 256); {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {111209#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:31,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {111209#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:31,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:31,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(0 == ~alive2~0 % 256); {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(main_~node2__m2~1#1 > ~id2~0); {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {111210#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {111205#false} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {111205#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {111205#false} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {111205#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {111205#false} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {111205#false} assume main_~node3__m3~1#1 != ~nomsg~0; {111205#false} is VALID [2022-02-20 18:45:31,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {111205#false} assume !(0 == ~alive3~0 % 256); {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {111205#false} assume !(main_~node3__m3~1#1 > ~id3~0); {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {111205#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {111205#false} ~mode3~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~1#1; {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {111205#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6353~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6353~0; {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {111205#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {111205#false} assume 0 == main_~assert__arg~2#1 % 256; {111205#false} is VALID [2022-02-20 18:45:31,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {111205#false} assume !false; {111205#false} is VALID [2022-02-20 18:45:31,328 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:31,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:31,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207439009] [2022-02-20 18:45:31,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207439009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:31,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:31,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:45:31,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653744366] [2022-02-20 18:45:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:45:31,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:31,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:31,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:31,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:45:31,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:45:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:45:31,372 INFO L87 Difference]: Start difference. First operand 4221 states and 6084 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)