./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.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.4.1.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 2218bd3b5024885ce258db0decccc6cd77d5db224efd54b84e54987ad5abfa77 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:46:02,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:46:02,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:46:02,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:46:02,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:46:02,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:46:02,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:46:02,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:46:02,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:46:02,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:46:02,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:46:02,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:46:02,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:46:02,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:46:02,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:46:02,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:46:02,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:46:02,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:46:02,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:46:02,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:46:02,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:46:02,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:46:02,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:46:02,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:46:02,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:46:02,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:46:02,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:46:02,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:46:02,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:46:02,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:46:02,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:46:02,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:46:02,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:46:02,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:46:02,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:46:02,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:46:02,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:46:02,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:46:02,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:46:02,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:46:02,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:46:02,948 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:46:02,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:46:02,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:46:02,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:46:02,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:46:02,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:46:02,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:46:02,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:46:02,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:46:02,979 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:46:02,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:46:02,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:46:02,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:46:02,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:46:02,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:46:02,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:46:02,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:46:02,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:46:02,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:46:02,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:02,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:46:02,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:46:02,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:46:02,984 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 -> 2218bd3b5024885ce258db0decccc6cd77d5db224efd54b84e54987ad5abfa77 [2022-02-20 18:46:03,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:46:03,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:46:03,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:46:03,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:46:03,180 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:46:03,181 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:03,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29821ecf6/def2d7712fbc4f34a91de86996f5447a/FLAG9b065a4f7 [2022-02-20 18:46:03,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:46:03,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:03,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29821ecf6/def2d7712fbc4f34a91de86996f5447a/FLAG9b065a4f7 [2022-02-20 18:46:03,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29821ecf6/def2d7712fbc4f34a91de86996f5447a [2022-02-20 18:46:03,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:46:03,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:46:03,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:03,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:46:03,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:46:03,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:03" (1/1) ... [2022-02-20 18:46:03,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe914c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:03, skipping insertion in model container [2022-02-20 18:46:03,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:03" (1/1) ... [2022-02-20 18:46:03,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:46:03,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:46:03,900 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2022-02-20 18:46:03,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:03,954 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:46:03,995 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2022-02-20 18:46:04,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:04,068 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:46:04,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04 WrapperNode [2022-02-20 18:46:04,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:04,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:04,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:46:04,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:46:04,074 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:46:04" (1/1) ... [2022-02-20 18:46:04,082 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:46:04" (1/1) ... [2022-02-20 18:46:04,119 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 662 [2022-02-20 18:46:04,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:04,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:46:04,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:46:04,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:46:04,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:46:04,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:46:04,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:46:04,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:46:04,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (1/1) ... [2022-02-20 18:46:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:46:04,193 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:46:04,211 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:46:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:46:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:46:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:46:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:46:04,310 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:46:04,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:46:04,835 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:46:04,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:46:04,845 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:46:04,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:04 BoogieIcfgContainer [2022-02-20 18:46:04,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:46:04,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:46:04,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:46:04,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:46:04,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:46:03" (1/3) ... [2022-02-20 18:46:04,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e87197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:04, skipping insertion in model container [2022-02-20 18:46:04,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:04" (2/3) ... [2022-02-20 18:46:04,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e87197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:04, skipping insertion in model container [2022-02-20 18:46:04,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:04" (3/3) ... [2022-02-20 18:46:04,854 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:04,857 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:46:04,857 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:46:04,889 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:46:04,894 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:46:04,895 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:46:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:46:04,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:04,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:04,936 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -113151096, now seen corresponding path program 1 times [2022-02-20 18:46:04,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:04,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417692997] [2022-02-20 18:46:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:05,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {182#true} is VALID [2022-02-20 18:46:05,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {182#true} is VALID [2022-02-20 18:46:05,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} assume 0 == ~r1~0 % 256; {182#true} is VALID [2022-02-20 18:46:05,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {182#true} is VALID [2022-02-20 18:46:05,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} assume ~id1~0 >= 0; {182#true} is VALID [2022-02-20 18:46:05,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} assume 0 == ~st1~0; {184#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:05,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {184#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:05,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {184#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:05,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(<= ~st1~0 0)} assume ~id2~0 >= 0; {184#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:05,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(<= ~st1~0 0)} assume 0 == ~st2~0; {185#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {185#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {185#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {185#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {185#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {186#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {187#(<= (+ ~st4~0 ~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; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {187#(<= (+ ~st4~0 ~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; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {187#(<= (+ ~st4~0 ~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; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:05,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {187#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {183#false} is VALID [2022-02-20 18:46:05,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {183#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {183#false} is VALID [2022-02-20 18:46:05,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {183#false} assume 0 == main_~assert__arg~1#1 % 256; {183#false} is VALID [2022-02-20 18:46:05,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 18:46:05,355 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:46:05,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:05,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417692997] [2022-02-20 18:46:05,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417692997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:05,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:05,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:05,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738574391] [2022-02-20 18:46:05,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:46:05,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:05,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:05,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:05,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:05,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:05,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:05,449 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:06,707 INFO L93 Difference]: Finished difference Result 639 states and 1034 transitions. [2022-02-20 18:46:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:46:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2022-02-20 18:46:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2022-02-20 18:46:06,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1034 transitions. [2022-02-20 18:46:07,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1034 edges. 1034 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:07,421 INFO L225 Difference]: With dead ends: 639 [2022-02-20 18:46:07,421 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 18:46:07,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:46:07,426 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 1598 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 1127 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:07,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1598 Valid, 1127 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 18:46:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 274. [2022-02-20 18:46:07,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:07,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,535 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,536 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:07,555 INFO L93 Difference]: Finished difference Result 540 states and 834 transitions. [2022-02-20 18:46:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 834 transitions. [2022-02-20 18:46:07,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:07,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:07,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:46:07,559 INFO L87 Difference]: Start difference. First operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:46:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:07,575 INFO L93 Difference]: Finished difference Result 540 states and 834 transitions. [2022-02-20 18:46:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 834 transitions. [2022-02-20 18:46:07,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:07,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:07,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:07,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 413 transitions. [2022-02-20 18:46:07,584 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 413 transitions. Word has length 64 [2022-02-20 18:46:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:07,584 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 413 transitions. [2022-02-20 18:46:07,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 413 transitions. [2022-02-20 18:46:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:46:07,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:07,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:07,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:46:07,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash 507394196, now seen corresponding path program 1 times [2022-02-20 18:46:07,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:07,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286351607] [2022-02-20 18:46:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:07,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {2482#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {2482#true} is VALID [2022-02-20 18:46:07,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {2482#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2482#true} is VALID [2022-02-20 18:46:07,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {2482#true} assume 0 == ~r1~0 % 256; {2482#true} is VALID [2022-02-20 18:46:07,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {2482#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:07,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {2484#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:07,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:07,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:07,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:07,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {2485#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:07,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:07,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:07,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:07,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:07,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:07,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:07,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:07,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {2487#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {2483#false} is VALID [2022-02-20 18:46:07,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {2483#false} assume !(~send4~0 != ~id4~0); {2483#false} is VALID [2022-02-20 18:46:07,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {2483#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2483#false} is VALID [2022-02-20 18:46:07,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {2483#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2483#false} is VALID [2022-02-20 18:46:07,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {2483#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {2483#false} is VALID [2022-02-20 18:46:07,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {2483#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {2483#false} assume !(0 == ~mode1~0 % 256); {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {2483#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {2483#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {2483#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {2483#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {2483#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {2483#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2483#false} is VALID [2022-02-20 18:46:07,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#false} ~mode4~0 := 0; {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {2483#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {2483#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {2483#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {2483#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2483#false} is VALID [2022-02-20 18:46:07,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {2483#false} assume 0 == main_~assert__arg~1#1 % 256; {2483#false} is VALID [2022-02-20 18:46:07,759 INFO L290 TraceCheckUtils]: 64: Hoare triple {2483#false} assume !false; {2483#false} is VALID [2022-02-20 18:46:07,759 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:46:07,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:07,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286351607] [2022-02-20 18:46:07,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286351607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:07,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:07,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:07,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92299453] [2022-02-20 18:46:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:07,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:07,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:07,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:07,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:07,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:07,822 INFO L87 Difference]: Start difference. First operand 274 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:09,204 INFO L93 Difference]: Finished difference Result 1012 states and 1565 transitions. [2022-02-20 18:46:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:09,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2022-02-20 18:46:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2022-02-20 18:46:09,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 896 transitions. [2022-02-20 18:46:09,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 896 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:09,890 INFO L225 Difference]: With dead ends: 1012 [2022-02-20 18:46:09,891 INFO L226 Difference]: Without dead ends: 800 [2022-02-20 18:46:09,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:09,892 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 950 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:09,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 896 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-02-20 18:46:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2022-02-20 18:46:10,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:10,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 800 states. Second operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,290 INFO L74 IsIncluded]: Start isIncluded. First operand 800 states. Second operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,292 INFO L87 Difference]: Start difference. First operand 800 states. Second operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:10,316 INFO L93 Difference]: Finished difference Result 800 states and 1221 transitions. [2022-02-20 18:46:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1221 transitions. [2022-02-20 18:46:10,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:10,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:10,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 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 800 states. [2022-02-20 18:46:10,320 INFO L87 Difference]: Start difference. First operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 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 800 states. [2022-02-20 18:46:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:10,344 INFO L93 Difference]: Finished difference Result 800 states and 1221 transitions. [2022-02-20 18:46:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1221 transitions. [2022-02-20 18:46:10,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:10,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:10,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:10,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1218 transitions. [2022-02-20 18:46:10,373 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1218 transitions. Word has length 65 [2022-02-20 18:46:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:10,373 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1218 transitions. [2022-02-20 18:46:10,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1218 transitions. [2022-02-20 18:46:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:46:10,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:10,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:10,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:46:10,375 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1175932082, now seen corresponding path program 1 times [2022-02-20 18:46:10,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:10,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016355073] [2022-02-20 18:46:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:10,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {6482#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:10,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {6484#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6485#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:10,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {6485#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {6485#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:10,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {6485#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6486#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:10,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {6486#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6483#false} is VALID [2022-02-20 18:46:10,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {6483#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); {6483#false} is VALID [2022-02-20 18:46:10,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {6483#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {6483#false} assume !!(0 == ~mode3~0 % 256); {6483#false} is VALID [2022-02-20 18:46:10,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {6483#false} assume !!(0 == ~alive3~0 % 256); {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {6483#false} assume !(~send3~0 != ~id3~0); {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {6483#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {6483#false} assume !!(0 == ~mode4~0 % 256); {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {6483#false} assume !!(0 == ~alive4~0 % 256); {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {6483#false} assume !(~send4~0 != ~id4~0); {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {6483#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6483#false} is VALID [2022-02-20 18:46:10,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {6483#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {6483#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {6483#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {6483#false} assume !(0 == ~mode1~0 % 256); {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {6483#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {6483#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6483#false} is VALID [2022-02-20 18:46:10,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {6483#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {6483#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {6483#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {6483#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {6483#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {6483#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {6483#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {6483#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6483#false} is VALID [2022-02-20 18:46:10,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {6483#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {6483#false} is VALID [2022-02-20 18:46:10,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {6483#false} ~mode4~0 := 0; {6483#false} is VALID [2022-02-20 18:46:10,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {6483#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6483#false} is VALID [2022-02-20 18:46:10,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {6483#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6483#false} is VALID [2022-02-20 18:46:10,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {6483#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {6483#false} is VALID [2022-02-20 18:46:10,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {6483#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {6483#false} is VALID [2022-02-20 18:46:10,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {6483#false} assume 0 == main_~assert__arg~1#1 % 256; {6483#false} is VALID [2022-02-20 18:46:10,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {6483#false} assume !false; {6483#false} is VALID [2022-02-20 18:46:10,505 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:46:10,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:10,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016355073] [2022-02-20 18:46:10,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016355073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:10,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:10,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:10,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720403404] [2022-02-20 18:46:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:10,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:10,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:10,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:10,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:10,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:10,543 INFO L87 Difference]: Start difference. First operand 794 states and 1218 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:12,426 INFO L93 Difference]: Finished difference Result 2126 states and 3304 transitions. [2022-02-20 18:46:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:12,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-02-20 18:46:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-02-20 18:46:12,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-02-20 18:46:12,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:12,880 INFO L225 Difference]: With dead ends: 2126 [2022-02-20 18:46:12,881 INFO L226 Difference]: Without dead ends: 1382 [2022-02-20 18:46:12,882 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:46:12,883 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 997 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:12,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 246 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-02-20 18:46:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1380. [2022-02-20 18:46:14,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:14,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1382 states. Second operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,027 INFO L74 IsIncluded]: Start isIncluded. First operand 1382 states. Second operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,029 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:14,084 INFO L93 Difference]: Finished difference Result 1382 states and 2132 transitions. [2022-02-20 18:46:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2132 transitions. [2022-02-20 18:46:14,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:14,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:14,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 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 1382 states. [2022-02-20 18:46:14,090 INFO L87 Difference]: Start difference. First operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 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 1382 states. [2022-02-20 18:46:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:14,150 INFO L93 Difference]: Finished difference Result 1382 states and 2132 transitions. [2022-02-20 18:46:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2132 transitions. [2022-02-20 18:46:14,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:14,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:14,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:14,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2131 transitions. [2022-02-20 18:46:14,226 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2131 transitions. Word has length 66 [2022-02-20 18:46:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:14,227 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 2131 transitions. [2022-02-20 18:46:14,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2131 transitions. [2022-02-20 18:46:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:46:14,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:14,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:14,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:46:14,230 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 195420080, now seen corresponding path program 1 times [2022-02-20 18:46:14,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:14,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215880676] [2022-02-20 18:46:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:14,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {13969#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {13971#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:14,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {13971#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {13972#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:46:14,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {13972#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {13972#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:46:14,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {13972#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send1~0 != ~id1~0); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13973#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:14,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {13973#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13970#false} is VALID [2022-02-20 18:46:14,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {13970#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256); {13970#false} is VALID [2022-02-20 18:46:14,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {13970#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13970#false} is VALID [2022-02-20 18:46:14,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {13970#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13970#false} is VALID [2022-02-20 18:46:14,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {13970#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {13970#false} is VALID [2022-02-20 18:46:14,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {13970#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {13970#false} assume !(0 == ~mode1~0 % 256); {13970#false} is VALID [2022-02-20 18:46:14,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {13970#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {13970#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13970#false} is VALID [2022-02-20 18:46:14,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {13970#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {13970#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {13970#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13970#false} is VALID [2022-02-20 18:46:14,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {13970#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {13970#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {13970#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13970#false} is VALID [2022-02-20 18:46:14,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {13970#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {13970#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13970#false} is VALID [2022-02-20 18:46:14,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {13970#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13970#false} is VALID [2022-02-20 18:46:14,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} ~mode4~0 := 0; {13970#false} is VALID [2022-02-20 18:46:14,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {13970#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13970#false} is VALID [2022-02-20 18:46:14,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13970#false} is VALID [2022-02-20 18:46:14,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {13970#false} is VALID [2022-02-20 18:46:14,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {13970#false} is VALID [2022-02-20 18:46:14,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {13970#false} assume 0 == main_~assert__arg~1#1 % 256; {13970#false} is VALID [2022-02-20 18:46:14,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-02-20 18:46:14,343 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:46:14,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:14,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215880676] [2022-02-20 18:46:14,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215880676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:14,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:14,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:14,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063217488] [2022-02-20 18:46:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:14,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:14,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:14,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:14,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:14,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:14,383 INFO L87 Difference]: Start difference. First operand 1380 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:18,075 INFO L93 Difference]: Finished difference Result 3712 states and 5789 transitions. [2022-02-20 18:46:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:18,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-02-20 18:46:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-02-20 18:46:18,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 560 transitions. [2022-02-20 18:46:18,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:18,646 INFO L225 Difference]: With dead ends: 3712 [2022-02-20 18:46:18,646 INFO L226 Difference]: Without dead ends: 2432 [2022-02-20 18:46:18,647 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:46:18,648 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 923 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:18,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 252 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-02-20 18:46:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2430. [2022-02-20 18:46:21,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:21,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2432 states. Second operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,214 INFO L74 IsIncluded]: Start isIncluded. First operand 2432 states. Second operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,218 INFO L87 Difference]: Start difference. First operand 2432 states. Second operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:21,378 INFO L93 Difference]: Finished difference Result 2432 states and 3766 transitions. [2022-02-20 18:46:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3766 transitions. [2022-02-20 18:46:21,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:21,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 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 2432 states. [2022-02-20 18:46:21,389 INFO L87 Difference]: Start difference. First operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 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 2432 states. [2022-02-20 18:46:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:21,550 INFO L93 Difference]: Finished difference Result 2432 states and 3766 transitions. [2022-02-20 18:46:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3766 transitions. [2022-02-20 18:46:21,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:21,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:21,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:21,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3765 transitions. [2022-02-20 18:46:21,788 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3765 transitions. Word has length 66 [2022-02-20 18:46:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:21,788 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 3765 transitions. [2022-02-20 18:46:21,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3765 transitions. [2022-02-20 18:46:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:46:21,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:21,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:21,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:46:21,790 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2140991135, now seen corresponding path program 1 times [2022-02-20 18:46:21,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:21,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742794249] [2022-02-20 18:46:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:21,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {27216#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {27218#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:21,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {27218#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {27219#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:46:21,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {27219#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {27219#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:46:21,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {27219#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send1~0 != ~id1~0); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {27220#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {27220#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {27217#false} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {27217#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); {27217#false} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {27217#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {27217#false} assume !!(0 == ~mode4~0 % 256); {27217#false} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {27217#false} assume !!(0 == ~alive4~0 % 256); {27217#false} is VALID [2022-02-20 18:46:21,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {27217#false} assume !(~send4~0 != ~id4~0); {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {27217#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {27217#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {27217#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {27217#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {27217#false} assume !(0 == ~mode1~0 % 256); {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {27217#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {27217#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {27217#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {27217#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {27217#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {27217#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {27217#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {27217#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {27217#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {27217#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {27217#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {27217#false} ~mode4~0 := 0; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {27217#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {27217#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {27217#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {27217#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {27217#false} assume 0 == main_~assert__arg~1#1 % 256; {27217#false} is VALID [2022-02-20 18:46:21,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {27217#false} assume !false; {27217#false} is VALID [2022-02-20 18:46:21,859 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:46:21,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:21,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742794249] [2022-02-20 18:46:21,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742794249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:21,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:21,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:21,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319112072] [2022-02-20 18:46:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:21,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:21,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:21,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:21,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:21,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:21,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:21,903 INFO L87 Difference]: Start difference. First operand 2430 states and 3765 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,117 INFO L93 Difference]: Finished difference Result 6933 states and 10800 transitions. [2022-02-20 18:46:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-02-20 18:46:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-02-20 18:46:30,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 580 transitions. [2022-02-20 18:46:30,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:31,250 INFO L225 Difference]: With dead ends: 6933 [2022-02-20 18:46:31,250 INFO L226 Difference]: Without dead ends: 4576 [2022-02-20 18:46:31,252 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:46:31,253 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 949 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:31,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 250 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2022-02-20 18:46:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2022-02-20 18:46:37,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:37,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4576 states. Second operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:37,396 INFO L74 IsIncluded]: Start isIncluded. First operand 4576 states. Second operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:37,402 INFO L87 Difference]: Start difference. First operand 4576 states. Second operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:37,971 INFO L93 Difference]: Finished difference Result 4576 states and 7082 transitions. [2022-02-20 18:46:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 7082 transitions. [2022-02-20 18:46:37,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:37,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:37,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 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 4576 states. [2022-02-20 18:46:37,988 INFO L87 Difference]: Start difference. First operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 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 4576 states. [2022-02-20 18:46:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:38,574 INFO L93 Difference]: Finished difference Result 4576 states and 7082 transitions. [2022-02-20 18:46:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 7082 transitions. [2022-02-20 18:46:38,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:38,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:38,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:38,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 7081 transitions. [2022-02-20 18:46:39,420 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 7081 transitions. Word has length 66 [2022-02-20 18:46:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:39,420 INFO L470 AbstractCegarLoop]: Abstraction has 4574 states and 7081 transitions. [2022-02-20 18:46:39,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 7081 transitions. [2022-02-20 18:46:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:46:39,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:39,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:39,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:46:39,422 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash -472666691, now seen corresponding path program 1 times [2022-02-20 18:46:39,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:39,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106856600] [2022-02-20 18:46:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:39,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {52186#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19141~0 := 0;~__return_19240~0 := 0;~__return_19398~0 := 0; {52188#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:39,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {52188#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {52188#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:39,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {52188#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {52188#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:39,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {52188#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {52188#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:39,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {52188#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {52189#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:46:39,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {52189#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {52189#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:46:39,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {52189#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19141~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19141~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {52190#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {52190#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {52187#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); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {52187#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {52187#false} assume !!(0 == ~mode2~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {52187#false} assume !!(0 == ~alive2~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {52187#false} assume !(~send2~0 != ~id2~0); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {52187#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {52187#false} assume !!(0 == ~mode3~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {52187#false} assume !!(0 == ~alive3~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {52187#false} assume !(~send3~0 != ~id3~0); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {52187#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {52187#false} assume !!(0 == ~mode4~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {52187#false} assume !!(0 == ~alive4~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {52187#false} assume !(~send4~0 != ~id4~0); {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {52187#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {52187#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {52187#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_19240~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19240~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; {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {52187#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {52187#false} assume !(0 == ~mode1~0 % 256); {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {52187#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {52187#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {52187#false} is VALID [2022-02-20 18:46:39,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {52187#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {52187#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {52187#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {52187#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {52187#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {52187#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {52187#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 57: Hoare triple {52187#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {52187#false} is VALID [2022-02-20 18:46:39,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {52187#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 59: Hoare triple {52187#false} ~mode4~0 := 0; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 60: Hoare triple {52187#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {52187#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {52187#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {52187#false} ~__return_19398~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19398~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 64: Hoare triple {52187#false} assume 0 == main_~assert__arg~1#1 % 256; {52187#false} is VALID [2022-02-20 18:46:39,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {52187#false} assume !false; {52187#false} is VALID [2022-02-20 18:46:39,482 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:46:39,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:39,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106856600] [2022-02-20 18:46:39,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106856600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:39,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:39,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:39,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870749216] [2022-02-20 18:46:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:46:39,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:39,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:39,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:39,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:39,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:39,519 INFO L87 Difference]: Start difference. First operand 4574 states and 7081 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:00,715 INFO L93 Difference]: Finished difference Result 13472 states and 20916 transitions. [2022-02-20 18:47:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:47:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-02-20 18:47:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-02-20 18:47:00,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 622 transitions. [2022-02-20 18:47:01,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:04,235 INFO L225 Difference]: With dead ends: 13472 [2022-02-20 18:47:04,235 INFO L226 Difference]: Without dead ends: 8932 [2022-02-20 18:47:04,239 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:47:04,240 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1005 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:04,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1005 Valid, 244 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8932 states.