./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:47:04,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:47:04,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:47:04,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:47:04,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:47:04,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:47:04,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:47:04,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:47:04,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:47:04,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:47:04,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:47:04,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:47:04,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:47:04,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:47:04,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:47:04,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:47:04,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:47:04,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:47:04,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:47:04,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:47:04,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:47:04,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:47:04,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:47:04,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:47:04,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:47:04,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:47:04,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:47:04,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:47:04,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:47:04,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:47:04,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:47:04,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:47:04,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:47:04,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:47:04,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:47:04,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:47:04,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:47:04,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:47:04,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:47:04,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:47:04,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:47:04,093 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:47:04,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:47:04,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:47:04,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:47:04,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:47:04,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:47:04,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:47:04,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:47:04,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:47:04,122 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:47:04,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:47:04,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:47:04,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:47:04,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:47:04,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:47:04,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:47:04,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:47:04,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:47:04,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:04,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:47:04,125 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:47:04,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:47:04,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:47:04,126 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 -> dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 [2022-02-20 18:47:04,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:47:04,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:47:04,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:47:04,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:47:04,339 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:47:04,340 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:47:04,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacab0c4e/874b8df84cac41d3b5c023103552f3d2/FLAG86c5dd211 [2022-02-20 18:47:04,784 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:47:04,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:47:04,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacab0c4e/874b8df84cac41d3b5c023103552f3d2/FLAG86c5dd211 [2022-02-20 18:47:04,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacab0c4e/874b8df84cac41d3b5c023103552f3d2 [2022-02-20 18:47:04,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:47:04,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:47:04,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:04,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:47:04,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:47:04,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:04" (1/1) ... [2022-02-20 18:47:04,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cca54db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:04, skipping insertion in model container [2022-02-20 18:47:04,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:04" (1/1) ... [2022-02-20 18:47:04,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:47:04,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:47:05,061 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2022-02-20 18:47:05,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:05,109 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:47:05,149 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2022-02-20 18:47:05,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:05,196 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:47:05,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05 WrapperNode [2022-02-20 18:47:05,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:05,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:05,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:47:05,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:47:05,203 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:47:05" (1/1) ... [2022-02-20 18:47:05,225 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:47:05" (1/1) ... [2022-02-20 18:47:05,262 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 422 [2022-02-20 18:47:05,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:05,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:47:05,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:47:05,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:47:05,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:47:05,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:47:05,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:47:05,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:47:05,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (1/1) ... [2022-02-20 18:47:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:05,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:47:05,336 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:47:05,343 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:47:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:47:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:47:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:47:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:47:05,463 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:47:05,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:47:05,919 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:47:05,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:47:05,926 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:47:05,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:05 BoogieIcfgContainer [2022-02-20 18:47:05,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:47:05,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:47:05,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:47:05,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:47:05,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:47:04" (1/3) ... [2022-02-20 18:47:05,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd36723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:05, skipping insertion in model container [2022-02-20 18:47:05,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:05" (2/3) ... [2022-02-20 18:47:05,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd36723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:05, skipping insertion in model container [2022-02-20 18:47:05,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:05" (3/3) ... [2022-02-20 18:47:05,935 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:47:05,939 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:47:05,939 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:47:05,989 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:47:05,995 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:47:05,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:47:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 111 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call 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:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:47:06,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:06,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:06,024 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2117585175, now seen corresponding path program 1 times [2022-02-20 18:47:06,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:06,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402503943] [2022-02-20 18:47:06,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:06,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {115#true} is VALID [2022-02-20 18:47:06,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {115#true} is VALID [2022-02-20 18:47:06,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} assume 0 == ~r1~0 % 256; {115#true} is VALID [2022-02-20 18:47:06,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {115#true} is VALID [2022-02-20 18:47:06,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {115#true} assume ~id1~0 >= 0; {115#true} is VALID [2022-02-20 18:47:06,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} assume 0 == ~st1~0; {115#true} is VALID [2022-02-20 18:47:06,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#true} assume ~send1~0 == ~id1~0; {115#true} is VALID [2022-02-20 18:47:06,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {115#true} assume 0 == ~mode1~0 % 256; {115#true} is VALID [2022-02-20 18:47:06,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#true} assume ~id2~0 >= 0; {115#true} is VALID [2022-02-20 18:47:06,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#true} assume 0 == ~st2~0; {115#true} is VALID [2022-02-20 18:47:06,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {115#true} assume ~send2~0 == ~id2~0; {115#true} is VALID [2022-02-20 18:47:06,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {115#true} assume 0 == ~mode2~0 % 256; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:47:06,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {117#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {116#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {116#false} ~mode2~0 := 0; {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {116#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {116#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {116#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:47:06,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {116#false} ~mode3~0 := 0; {116#false} is VALID [2022-02-20 18:47:06,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {116#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:47:06,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {116#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:47:06,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {116#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:47:06,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {116#false} ~mode4~0 := 0; {116#false} is VALID [2022-02-20 18:47:06,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {116#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {116#false} is VALID [2022-02-20 18:47:06,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {116#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {116#false} is VALID [2022-02-20 18:47:06,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {116#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {116#false} is VALID [2022-02-20 18:47:06,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {116#false} assume 0 == main_~assert__arg~0#1 % 256; {116#false} is VALID [2022-02-20 18:47:06,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-02-20 18:47:06,339 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:47:06,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:06,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402503943] [2022-02-20 18:47:06,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402503943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:06,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:06,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:47:06,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284562917] [2022-02-20 18:47:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:06,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:47:06,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:06,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:06,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:47:06,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:47:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:06,408 INFO L87 Difference]: Start difference. First operand has 112 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 111 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:06,770 INFO L93 Difference]: Finished difference Result 266 states and 425 transitions. [2022-02-20 18:47:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:47:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:47:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-02-20 18:47:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-02-20 18:47:06,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 425 transitions. [2022-02-20 18:47:07,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:07,087 INFO L225 Difference]: With dead ends: 266 [2022-02-20 18:47:07,088 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 18:47:07,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:07,095 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 130 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:07,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 384 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 18:47:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-02-20 18:47:07,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:07,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:07,153 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:07,154 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,169 INFO L93 Difference]: Finished difference Result 175 states and 260 transitions. [2022-02-20 18:47:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2022-02-20 18:47:07,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:07,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:07,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:47:07,174 INFO L87 Difference]: Start difference. First operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:47:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,179 INFO L93 Difference]: Finished difference Result 175 states and 260 transitions. [2022-02-20 18:47:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2022-02-20 18:47:07,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:07,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:07,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:07,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2022-02-20 18:47:07,197 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 49 [2022-02-20 18:47:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:07,198 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2022-02-20 18:47:07,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2022-02-20 18:47:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:47:07,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:07,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:07,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:47:07,202 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1419109229, now seen corresponding path program 1 times [2022-02-20 18:47:07,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:07,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901767664] [2022-02-20 18:47:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:07,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {1055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {1055#true} is VALID [2022-02-20 18:47:07,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume 0 == ~r1~0 % 256; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {1055#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {1055#true} assume ~id1~0 >= 0; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} assume 0 == ~st1~0; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#true} assume ~send1~0 == ~id1~0; {1055#true} is VALID [2022-02-20 18:47:07,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {1055#true} assume 0 == ~mode1~0 % 256; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1055#true} assume ~id2~0 >= 0; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#true} assume 0 == ~st2~0; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {1055#true} assume ~send2~0 == ~id2~0; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#true} assume 0 == ~mode2~0 % 256; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#true} assume ~id3~0 >= 0; {1055#true} is VALID [2022-02-20 18:47:07,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#true} assume 0 == ~st3~0; {1055#true} is VALID [2022-02-20 18:47:07,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1055#true} assume ~send3~0 == ~id3~0; {1055#true} is VALID [2022-02-20 18:47:07,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {1055#true} assume 0 == ~mode3~0 % 256; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:47:07,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {1057#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {1056#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {1056#false} ~mode3~0 := 0; {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {1056#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {1056#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {1056#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1056#false} is VALID [2022-02-20 18:47:07,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {1056#false} ~mode4~0 := 0; {1056#false} is VALID [2022-02-20 18:47:07,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {1056#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1056#false} is VALID [2022-02-20 18:47:07,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {1056#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {1056#false} is VALID [2022-02-20 18:47:07,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {1056#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {1056#false} is VALID [2022-02-20 18:47:07,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {1056#false} assume 0 == main_~assert__arg~0#1 % 256; {1056#false} is VALID [2022-02-20 18:47:07,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-02-20 18:47:07,296 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:47:07,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:07,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901767664] [2022-02-20 18:47:07,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901767664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:07,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:07,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:47:07,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914215544] [2022-02-20 18:47:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:47:07,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:07,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:07,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:47:07,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:47:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:07,330 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,523 INFO L93 Difference]: Finished difference Result 433 states and 671 transitions. [2022-02-20 18:47:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:47:07,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:47:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-02-20 18:47:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-02-20 18:47:07,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 391 transitions. [2022-02-20 18:47:07,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:07,777 INFO L225 Difference]: With dead ends: 433 [2022-02-20 18:47:07,777 INFO L226 Difference]: Without dead ends: 287 [2022-02-20 18:47:07,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:07,778 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:07,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 329 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-20 18:47:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-02-20 18:47:07,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:07,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call 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:07,794 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call 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:07,795 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call 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:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,801 INFO L93 Difference]: Finished difference Result 287 states and 437 transitions. [2022-02-20 18:47:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 437 transitions. [2022-02-20 18:47:07,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:07,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:07,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 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 287 states. [2022-02-20 18:47:07,803 INFO L87 Difference]: Start difference. First operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 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 287 states. [2022-02-20 18:47:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,809 INFO L93 Difference]: Finished difference Result 287 states and 437 transitions. [2022-02-20 18:47:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 437 transitions. [2022-02-20 18:47:07,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:07,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:07,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:07,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call 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:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2022-02-20 18:47:07,817 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 50 [2022-02-20 18:47:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:07,817 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2022-02-20 18:47:07,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2022-02-20 18:47:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:47:07,818 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:07,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:07,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:47:07,819 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1570665396, now seen corresponding path program 1 times [2022-02-20 18:47:07,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:07,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413198251] [2022-02-20 18:47:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:07,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {2608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {2608#true} is VALID [2022-02-20 18:47:07,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#true} assume 0 == ~r1~0 % 256; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {2608#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {2608#true} assume ~id1~0 >= 0; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {2608#true} assume 0 == ~st1~0; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#true} assume ~send1~0 == ~id1~0; {2608#true} is VALID [2022-02-20 18:47:07,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {2608#true} assume 0 == ~mode1~0 % 256; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {2608#true} assume ~id2~0 >= 0; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#true} assume 0 == ~st2~0; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#true} assume ~send2~0 == ~id2~0; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#true} assume 0 == ~mode2~0 % 256; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#true} assume ~id3~0 >= 0; {2608#true} is VALID [2022-02-20 18:47:07,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#true} assume 0 == ~st3~0; {2608#true} is VALID [2022-02-20 18:47:07,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {2608#true} assume ~send3~0 == ~id3~0; {2608#true} is VALID [2022-02-20 18:47:07,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#true} assume 0 == ~mode3~0 % 256; {2608#true} is VALID [2022-02-20 18:47:07,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {2608#true} assume ~id4~0 >= 0; {2608#true} is VALID [2022-02-20 18:47:07,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {2608#true} assume 0 == ~st4~0; {2608#true} is VALID [2022-02-20 18:47:07,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {2608#true} assume ~send4~0 == ~id4~0; {2608#true} is VALID [2022-02-20 18:47:07,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#true} assume 0 == ~mode4~0 % 256; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {2610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {2609#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {2609#false} ~mode4~0 := 0; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {2609#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {2609#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {2609#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {2609#false} assume 0 == main_~assert__arg~0#1 % 256; {2609#false} is VALID [2022-02-20 18:47:07,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {2609#false} assume !false; {2609#false} is VALID [2022-02-20 18:47:07,922 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:47:07,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:07,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413198251] [2022-02-20 18:47:07,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413198251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:07,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:07,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:47:07,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385136699] [2022-02-20 18:47:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:07,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:47:07,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:07,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:07,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:47:07,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:47:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:07,962 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:08,173 INFO L93 Difference]: Finished difference Result 737 states and 1150 transitions. [2022-02-20 18:47:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:47:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:47:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-02-20 18:47:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-02-20 18:47:08,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 391 transitions. [2022-02-20 18:47:08,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:08,429 INFO L225 Difference]: With dead ends: 737 [2022-02-20 18:47:08,430 INFO L226 Difference]: Without dead ends: 479 [2022-02-20 18:47:08,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:08,431 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:08,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-20 18:47:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2022-02-20 18:47:08,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:08,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call 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:08,453 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call 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:08,454 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call 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:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:08,467 INFO L93 Difference]: Finished difference Result 479 states and 737 transitions. [2022-02-20 18:47:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 737 transitions. [2022-02-20 18:47:08,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:08,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:08,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:47:08,469 INFO L87 Difference]: Start difference. First operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:47:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:08,482 INFO L93 Difference]: Finished difference Result 479 states and 737 transitions. [2022-02-20 18:47:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 737 transitions. [2022-02-20 18:47:08,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:08,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:08,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:08,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call 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:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 736 transitions. [2022-02-20 18:47:08,511 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 736 transitions. Word has length 51 [2022-02-20 18:47:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:08,512 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 736 transitions. [2022-02-20 18:47:08,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 736 transitions. [2022-02-20 18:47:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:47:08,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:08,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:08,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:47:08,515 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1205622842, now seen corresponding path program 1 times [2022-02-20 18:47:08,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:08,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036978299] [2022-02-20 18:47:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:08,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {5237#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {5237#true} is VALID [2022-02-20 18:47:08,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5237#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {5237#true} is VALID [2022-02-20 18:47:08,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume 0 == ~r1~0 % 256; {5237#true} is VALID [2022-02-20 18:47:08,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {5237#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {5237#true} is VALID [2022-02-20 18:47:08,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {5237#true} assume ~id1~0 >= 0; {5237#true} is VALID [2022-02-20 18:47:08,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {5237#true} assume 0 == ~st1~0; {5239#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:08,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {5239#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {5239#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:08,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {5239#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {5239#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:08,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {5239#(<= ~st1~0 0)} assume ~id2~0 >= 0; {5239#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:08,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {5239#(<= ~st1~0 0)} assume 0 == ~st2~0; {5240#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {5240#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {5240#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {5240#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {5240#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {5240#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {5240#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {5240#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {5241#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {5242#(<= (+ ~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; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:08,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {5242#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {5238#false} is VALID [2022-02-20 18:47:08,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {5238#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {5238#false} is VALID [2022-02-20 18:47:08,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {5238#false} assume 0 == main_~assert__arg~0#1 % 256; {5238#false} is VALID [2022-02-20 18:47:08,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-02-20 18:47:08,614 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:47:08,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:08,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036978299] [2022-02-20 18:47:08,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036978299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:08,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:08,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:47:08,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347436681] [2022-02-20 18:47:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:47:08,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:08,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:08,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:08,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:47:08,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:47:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:08,644 INFO L87 Difference]: Start difference. First operand 477 states and 736 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:10,461 INFO L93 Difference]: Finished difference Result 2727 states and 4281 transitions. [2022-02-20 18:47:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:47:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2022-02-20 18:47:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2022-02-20 18:47:10,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 807 transitions. [2022-02-20 18:47:10,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 807 edges. 807 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:11,126 INFO L225 Difference]: With dead ends: 2727 [2022-02-20 18:47:11,126 INFO L226 Difference]: Without dead ends: 2277 [2022-02-20 18:47:11,127 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:47:11,131 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 1016 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:11,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 1218 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2022-02-20 18:47:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 925. [2022-02-20 18:47:11,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:11,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2277 states. Second operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call 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:11,706 INFO L74 IsIncluded]: Start isIncluded. First operand 2277 states. Second operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call 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:11,708 INFO L87 Difference]: Start difference. First operand 2277 states. Second operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call 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:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:11,842 INFO L93 Difference]: Finished difference Result 2277 states and 3556 transitions. [2022-02-20 18:47:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3556 transitions. [2022-02-20 18:47:11,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:11,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:11,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 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 2277 states. [2022-02-20 18:47:11,849 INFO L87 Difference]: Start difference. First operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 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 2277 states. [2022-02-20 18:47:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:11,993 INFO L93 Difference]: Finished difference Result 2277 states and 3556 transitions. [2022-02-20 18:47:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3556 transitions. [2022-02-20 18:47:11,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:11,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:11,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:11,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call 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:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1428 transitions. [2022-02-20 18:47:12,031 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1428 transitions. Word has length 52 [2022-02-20 18:47:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:12,032 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1428 transitions. [2022-02-20 18:47:12,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1428 transitions. [2022-02-20 18:47:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:47:12,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:12,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:12,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:47:12,034 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1299853839, now seen corresponding path program 1 times [2022-02-20 18:47:12,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:12,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368765879] [2022-02-20 18:47:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:12,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:12,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {14866#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {14866#true} is VALID [2022-02-20 18:47:12,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {14866#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {14866#true} is VALID [2022-02-20 18:47:12,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {14866#true} assume 0 == ~r1~0 % 256; {14866#true} is VALID [2022-02-20 18:47:12,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {14866#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {14868#(<= (+ (* (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:47:12,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {14868#(<= (+ (* (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_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {14868#(<= (+ (* (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:47:12,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {14868#(<= (+ (* (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; {14868#(<= (+ (* (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:47:12,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {14868#(<= (+ (* (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))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14868#(<= (+ (* (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:47:12,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {14868#(<= (+ (* (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); {14868#(<= (+ (* (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:47:12,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {14868#(<= (+ (* (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); {14869#(<= (+ (* (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:47:12,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {14869#(<= (+ (* (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); {14869#(<= (+ (* (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:47:12,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {14869#(<= (+ (* (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; {14869#(<= (+ (* (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:47:12,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {14869#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14869#(<= (+ (* (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:47:12,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {14869#(<= (+ (* (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); {14869#(<= (+ (* (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:47:12,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {14869#(<= (+ (* (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); {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:12,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:12,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:12,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:12,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:12,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {14870#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:12,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:12,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:12,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:12,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:12,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {14871#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {14867#false} is VALID [2022-02-20 18:47:12,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {14867#false} assume !(~send4~0 != ~id4~0); {14867#false} is VALID [2022-02-20 18:47:12,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {14867#false} ~mode4~0 := 1; {14867#false} is VALID [2022-02-20 18:47:12,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {14867#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14867#false} is VALID [2022-02-20 18:47:12,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {14867#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14867#false} is VALID [2022-02-20 18:47:12,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {14867#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {14867#false} is VALID [2022-02-20 18:47:12,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {14867#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {14867#false} is VALID [2022-02-20 18:47:12,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {14867#false} assume 0 == main_~assert__arg~0#1 % 256; {14867#false} is VALID [2022-02-20 18:47:12,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {14867#false} assume !false; {14867#false} is VALID [2022-02-20 18:47:12,209 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:47:12,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:12,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368765879] [2022-02-20 18:47:12,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368765879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:12,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:12,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:47:12,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039214732] [2022-02-20 18:47:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:12,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:47:12,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:12,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:12,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:12,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:47:12,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:47:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:12,250 INFO L87 Difference]: Start difference. First operand 925 states and 1428 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:15,976 INFO L93 Difference]: Finished difference Result 4029 states and 6232 transitions. [2022-02-20 18:47:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:47:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2022-02-20 18:47:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2022-02-20 18:47:15,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 585 transitions. [2022-02-20 18:47:16,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:16,783 INFO L225 Difference]: With dead ends: 4029 [2022-02-20 18:47:16,783 INFO L226 Difference]: Without dead ends: 3131 [2022-02-20 18:47:16,784 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:47:16,785 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 509 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:16,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 739 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2022-02-20 18:47:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3125. [2022-02-20 18:47:19,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:19,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3131 states. Second operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 0 states have call 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:19,176 INFO L74 IsIncluded]: Start isIncluded. First operand 3131 states. Second operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 0 states have call 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:19,181 INFO L87 Difference]: Start difference. First operand 3131 states. Second operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 0 states have call 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:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:19,460 INFO L93 Difference]: Finished difference Result 3131 states and 4815 transitions. [2022-02-20 18:47:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4815 transitions. [2022-02-20 18:47:19,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:19,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:19,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 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 3131 states. [2022-02-20 18:47:19,473 INFO L87 Difference]: Start difference. First operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 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 3131 states. [2022-02-20 18:47:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:19,742 INFO L93 Difference]: Finished difference Result 3131 states and 4815 transitions. [2022-02-20 18:47:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4815 transitions. [2022-02-20 18:47:19,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:19,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:19,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:19,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 0 states have call 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:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4812 transitions. [2022-02-20 18:47:20,129 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4812 transitions. Word has length 53 [2022-02-20 18:47:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:20,130 INFO L470 AbstractCegarLoop]: Abstraction has 3125 states and 4812 transitions. [2022-02-20 18:47:20,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4812 transitions. [2022-02-20 18:47:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:47:20,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:20,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:20,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:47:20,131 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1774851107, now seen corresponding path program 1 times [2022-02-20 18:47:20,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:20,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830415267] [2022-02-20 18:47:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:20,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {31106#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {31106#true} is VALID [2022-02-20 18:47:20,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {31106#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {31106#true} is VALID [2022-02-20 18:47:20,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {31106#true} assume 0 == ~r1~0 % 256; {31106#true} is VALID [2022-02-20 18:47:20,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {31106#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {31106#true} is VALID [2022-02-20 18:47:20,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {31106#true} assume ~id1~0 >= 0; {31106#true} is VALID [2022-02-20 18:47:20,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {31106#true} assume 0 == ~st1~0; {31106#true} is VALID [2022-02-20 18:47:20,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {31106#true} assume ~send1~0 == ~id1~0; {31106#true} is VALID [2022-02-20 18:47:20,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {31106#true} assume 0 == ~mode1~0 % 256; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:47:20,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {31108#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {31107#false} assume 255 == ~r1~0 % 256;~r1~0 := 3; {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {31107#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {31107#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {31107#false} ~mode1~0 := 0; {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {31107#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {31107#false} assume !!(0 == ~mode2~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {31107#false} assume !!(0 == ~alive2~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {31107#false} assume !(~send2~0 != ~id2~0); {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {31107#false} ~mode2~0 := 1; {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {31107#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {31107#false} assume !!(0 == ~mode3~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {31107#false} assume !!(0 == ~alive3~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {31107#false} assume !(~send3~0 != ~id3~0); {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {31107#false} ~mode3~0 := 1; {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {31107#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {31107#false} is VALID [2022-02-20 18:47:20,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {31107#false} assume !!(0 == ~mode4~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {31107#false} assume !!(0 == ~alive4~0 % 256); {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {31107#false} assume !(~send4~0 != ~id4~0); {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {31107#false} ~mode4~0 := 1; {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {31107#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {31107#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {31107#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {31107#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {31107#false} is VALID [2022-02-20 18:47:20,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {31107#false} assume 0 == main_~assert__arg~0#1 % 256; {31107#false} is VALID [2022-02-20 18:47:20,175 INFO L290 TraceCheckUtils]: 53: Hoare triple {31107#false} assume !false; {31107#false} is VALID [2022-02-20 18:47:20,175 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:47:20,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:20,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830415267] [2022-02-20 18:47:20,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830415267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:20,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:20,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:47:20,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442898804] [2022-02-20 18:47:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:47:20,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:20,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:20,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:47:20,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:20,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:47:20,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:20,205 INFO L87 Difference]: Start difference. First operand 3125 states and 4812 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:26,770 INFO L93 Difference]: Finished difference Result 8249 states and 12654 transitions. [2022-02-20 18:47:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:47:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:47:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-02-20 18:47:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-02-20 18:47:26,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 388 transitions. [2022-02-20 18:47:26,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:27,975 INFO L225 Difference]: With dead ends: 8249 [2022-02-20 18:47:27,975 INFO L226 Difference]: Without dead ends: 5151 [2022-02-20 18:47:27,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:47:27,979 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:27,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2022-02-20 18:47:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 5149. [2022-02-20 18:47:31,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:31,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5151 states. Second operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 0 states have call 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:31,925 INFO L74 IsIncluded]: Start isIncluded. First operand 5151 states. Second operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 0 states have call 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:31,928 INFO L87 Difference]: Start difference. First operand 5151 states. Second operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 0 states have call 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:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:32,583 INFO L93 Difference]: Finished difference Result 5151 states and 7805 transitions. [2022-02-20 18:47:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5151 states and 7805 transitions. [2022-02-20 18:47:32,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:32,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:32,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 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 5151 states. [2022-02-20 18:47:32,599 INFO L87 Difference]: Start difference. First operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 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 5151 states. [2022-02-20 18:47:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:33,309 INFO L93 Difference]: Finished difference Result 5151 states and 7805 transitions. [2022-02-20 18:47:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5151 states and 7805 transitions. [2022-02-20 18:47:33,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:33,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:33,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:33,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 0 states have call 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:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 7804 transitions. [2022-02-20 18:47:34,337 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 7804 transitions. Word has length 54 [2022-02-20 18:47:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:34,337 INFO L470 AbstractCegarLoop]: Abstraction has 5149 states and 7804 transitions. [2022-02-20 18:47:34,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 7804 transitions. [2022-02-20 18:47:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:47:34,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:34,338 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] [2022-02-20 18:47:34,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:47:34,338 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -850826877, now seen corresponding path program 1 times [2022-02-20 18:47:34,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:34,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810700333] [2022-02-20 18:47:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:34,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {60139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {60139#true} is VALID [2022-02-20 18:47:34,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {60139#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {60139#true} is VALID [2022-02-20 18:47:34,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {60139#true} assume 0 == ~r1~0 % 256; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {60139#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {60139#true} assume ~id1~0 >= 0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {60139#true} assume 0 == ~st1~0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {60139#true} assume ~send1~0 == ~id1~0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {60139#true} assume 0 == ~mode1~0 % 256; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {60139#true} assume ~id2~0 >= 0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {60139#true} assume 0 == ~st2~0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {60139#true} assume ~send2~0 == ~id2~0; {60139#true} is VALID [2022-02-20 18:47:34,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {60139#true} assume 0 == ~mode2~0 % 256; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {60139#true} assume ~id3~0 >= 0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {60139#true} assume 0 == ~st3~0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {60139#true} assume ~send3~0 == ~id3~0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {60139#true} assume 0 == ~mode3~0 % 256; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {60139#true} assume ~id4~0 >= 0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {60139#true} assume 0 == ~st4~0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {60139#true} assume ~send4~0 == ~id4~0; {60139#true} is VALID [2022-02-20 18:47:34,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {60139#true} assume 0 == ~mode4~0 % 256; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {60139#true} assume ~id1~0 != ~id2~0; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {60139#true} assume ~id1~0 != ~id3~0; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {60139#true} assume ~id1~0 != ~id4~0; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {60139#true} assume ~id2~0 != ~id3~0; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {60139#true} assume ~id2~0 != ~id4~0; {60139#true} is VALID [2022-02-20 18:47:34,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {60139#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {60141#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {60141#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {60139#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {60139#true} assume !!(0 == ~mode1~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {60139#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {60139#true} assume ~send1~0 != ~nomsg~0; {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {60139#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {60139#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {60139#true} is VALID [2022-02-20 18:47:34,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {60139#true} ~mode1~0 := 1; {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {60139#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {60139#true} assume !!(0 == ~mode2~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {60139#true} assume !!(0 == ~alive2~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {60139#true} assume !(~send2~0 != ~id2~0); {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {60139#true} ~mode2~0 := 1; {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {60139#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {60139#true} assume !!(0 == ~mode3~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {60139#true} assume !!(0 == ~alive3~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {60139#true} assume !(~send3~0 != ~id3~0); {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {60139#true} ~mode3~0 := 1; {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {60139#true} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {60139#true} assume !!(0 == ~mode4~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {60139#true} assume !!(0 == ~alive4~0 % 256); {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {60139#true} assume !(~send4~0 != ~id4~0); {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {60139#true} ~mode4~0 := 1; {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {60139#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {60139#true} is VALID [2022-02-20 18:47:34,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {60139#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {60139#true} is VALID [2022-02-20 18:47:34,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {60139#true} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {60142#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:47:34,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {60142#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {60143#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:47:34,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {60143#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {60140#false} is VALID [2022-02-20 18:47:34,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {60140#false} assume !false; {60140#false} is VALID [2022-02-20 18:47:34,412 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:47:34,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:34,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810700333] [2022-02-20 18:47:34,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810700333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:34,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:34,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:47:34,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44916224] [2022-02-20 18:47:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:47:34,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:34,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:34,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:34,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:34,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:34,442 INFO L87 Difference]: Start difference. First operand 5149 states and 7804 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:48,828 INFO L93 Difference]: Finished difference Result 10527 states and 15837 transitions. [2022-02-20 18:47:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:47:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2022-02-20 18:47:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2022-02-20 18:47:48,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 289 transitions. [2022-02-20 18:47:49,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:53,277 INFO L225 Difference]: With dead ends: 10527 [2022-02-20 18:47:53,277 INFO L226 Difference]: Without dead ends: 10525 [2022-02-20 18:47:53,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:53,279 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 248 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:53,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 771 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:47:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10525 states. [2022-02-20 18:47:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10525 to 5405. [2022-02-20 18:47:59,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:59,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10525 states. Second operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call 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:59,043 INFO L74 IsIncluded]: Start isIncluded. First operand 10525 states. Second operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call 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:59,046 INFO L87 Difference]: Start difference. First operand 10525 states. Second operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:01,869 INFO L93 Difference]: Finished difference Result 10525 states and 15708 transitions. [2022-02-20 18:48:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 10525 states and 15708 transitions. [2022-02-20 18:48:01,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:01,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:01,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 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 10525 states. [2022-02-20 18:48:01,889 INFO L87 Difference]: Start difference. First operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 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 10525 states. [2022-02-20 18:48:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:04,770 INFO L93 Difference]: Finished difference Result 10525 states and 15708 transitions. [2022-02-20 18:48:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10525 states and 15708 transitions. [2022-02-20 18:48:04,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:04,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:04,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:04,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 8060 transitions. [2022-02-20 18:48:05,902 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 8060 transitions. Word has length 55 [2022-02-20 18:48:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:05,903 INFO L470 AbstractCegarLoop]: Abstraction has 5405 states and 8060 transitions. [2022-02-20 18:48:05,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 8060 transitions. [2022-02-20 18:48:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:48:05,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:05,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:05,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:48:05,904 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -595256360, now seen corresponding path program 1 times [2022-02-20 18:48:05,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:05,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573174566] [2022-02-20 18:48:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:05,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {103659#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(63, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~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_19080~0 := 0;~__return_19215~0 := 0; {103659#true} is VALID [2022-02-20 18:48:05,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {103659#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_~__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~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {103659#true} is VALID [2022-02-20 18:48:05,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {103659#true} assume 0 == ~r1~0 % 256; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19080~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19080~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive2~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~id2~0); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive3~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode4~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive4~0 % 256); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~id4~0); {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode4~0 := 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:48:05,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {103661#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 4); {103660#false} is VALID [2022-02-20 18:48:05,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {103660#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~0#1 := 0; {103660#false} is VALID [2022-02-20 18:48:05,997 INFO L290 TraceCheckUtils]: 53: Hoare triple {103660#false} ~__return_19215~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19215~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; {103660#false} is VALID [2022-02-20 18:48:05,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {103660#false} assume 0 == main_~assert__arg~0#1 % 256; {103660#false} is VALID [2022-02-20 18:48:05,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {103660#false} assume !false; {103660#false} is VALID [2022-02-20 18:48:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:05,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:05,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573174566] [2022-02-20 18:48:05,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573174566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:05,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:05,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:05,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496315768] [2022-02-20 18:48:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:48:05,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:05,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:06,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:06,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:06,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:06,031 INFO L87 Difference]: Start difference. First operand 5405 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)