./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1221f43edcd55fb28cc2c33b3cd78828237d81c097e561fccaa486cdd56e141 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:46:35,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:46:35,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:46:35,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:46:35,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:46:35,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:46:35,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:46:35,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:46:35,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:46:35,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:46:35,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:46:35,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:46:35,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:46:35,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:46:35,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:46:35,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:46:35,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:46:35,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:46:35,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:46:35,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:46:35,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:46:35,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:46:35,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:46:35,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:46:35,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:46:35,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:46:35,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:46:35,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:46:35,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:46:35,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:46:35,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:46:35,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:46:35,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:46:35,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:46:35,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:46:35,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:46:35,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:46:35,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:46:35,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:46:35,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:46:35,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:46:35,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:46:35,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:46:35,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:46:35,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:46:35,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:46:35,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:46:35,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:46:35,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:46:35,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:46:35,978 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:46:35,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:46:35,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:46:35,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:46:35,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:46:35,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:46:35,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:46:35,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:46:35,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:46:35,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:46:35,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:46:35,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:35,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:46:35,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:46:35,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:46:35,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:46:35,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:46:35,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:46:35,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:46:35,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:46:35,983 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 -> e1221f43edcd55fb28cc2c33b3cd78828237d81c097e561fccaa486cdd56e141 [2022-02-20 18:46:36,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:46:36,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:46:36,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:46:36,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:46:36,250 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:46:36,252 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:36,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474736e21/e32d1c2d1a2844738cc295462aefc706/FLAG5c5a8bb5a [2022-02-20 18:46:36,711 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:46:36,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:36,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474736e21/e32d1c2d1a2844738cc295462aefc706/FLAG5c5a8bb5a [2022-02-20 18:46:36,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474736e21/e32d1c2d1a2844738cc295462aefc706 [2022-02-20 18:46:36,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:46:36,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:46:36,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:36,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:46:36,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:46:36,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:36" (1/1) ... [2022-02-20 18:46:36,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b9fbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:36, skipping insertion in model container [2022-02-20 18:46:36,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:36" (1/1) ... [2022-02-20 18:46:36,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:46:36,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:46:37,049 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2022-02-20 18:46:37,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:37,137 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:46:37,199 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2022-02-20 18:46:37,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:37,271 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:46:37,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37 WrapperNode [2022-02-20 18:46:37,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:37,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:37,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:46:37,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:46:37,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,368 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 636 [2022-02-20 18:46:37,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:37,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:46:37,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:46:37,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:46:37,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:46:37,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:46:37,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:46:37,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:46:37,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (1/1) ... [2022-02-20 18:46:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:46:37,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:46:37,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:46:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:46:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:46:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:46:37,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:46:37,569 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:46:37,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:46:38,158 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:46:38,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:46:38,166 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:46:38,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:38 BoogieIcfgContainer [2022-02-20 18:46:38,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:46:38,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:46:38,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:46:38,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:46:38,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:46:36" (1/3) ... [2022-02-20 18:46:38,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4fe631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:38, skipping insertion in model container [2022-02-20 18:46:38,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:37" (2/3) ... [2022-02-20 18:46:38,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4fe631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:38, skipping insertion in model container [2022-02-20 18:46:38,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:38" (3/3) ... [2022-02-20 18:46:38,175 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:46:38,179 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:46:38,180 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:46:38,215 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:46:38,220 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:46:38,221 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:46:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:46:38,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:38,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:38,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1270648051, now seen corresponding path program 1 times [2022-02-20 18:46:38,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:38,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136534474] [2022-02-20 18:46:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:38,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {173#true} is VALID [2022-02-20 18:46:38,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {173#true} is VALID [2022-02-20 18:46:38,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume 0 == ~r1~0 % 256; {173#true} is VALID [2022-02-20 18:46:38,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {173#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {173#true} is VALID [2022-02-20 18:46:38,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {173#true} assume ~id1~0 >= 0; {173#true} is VALID [2022-02-20 18:46:38,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} assume 0 == ~st1~0; {175#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:38,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {175#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:38,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {175#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:38,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= ~st1~0 0)} assume ~id2~0 >= 0; {175#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:38,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#(<= ~st1~0 0)} assume 0 == ~st2~0; {176#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {176#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {176#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {176#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {176#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {176#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {176#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {177#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:38,696 INFO L290 TraceCheckUtils]: 59: Hoare triple {178#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {174#false} is VALID [2022-02-20 18:46:38,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {174#false} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {174#false} is VALID [2022-02-20 18:46:38,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {174#false} assume 0 == main_~assert__arg~1#1 % 256; {174#false} is VALID [2022-02-20 18:46:38,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-02-20 18:46:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:46:38,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:38,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136534474] [2022-02-20 18:46:38,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136534474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:38,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:38,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:38,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981619109] [2022-02-20 18:46:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:46:38,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:38,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:38,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:38,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:38,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:38,815 INFO L87 Difference]: Start difference. First operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:40,289 INFO L93 Difference]: Finished difference Result 605 states and 979 transitions. [2022-02-20 18:46:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:46:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2022-02-20 18:46:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2022-02-20 18:46:40,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 979 transitions. [2022-02-20 18:46:41,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 979 edges. 979 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:41,138 INFO L225 Difference]: With dead ends: 605 [2022-02-20 18:46:41,138 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:46:41,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:46:41,145 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 1748 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:41,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1748 Valid, 958 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:46:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 260. [2022-02-20 18:46:41,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:41,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,287 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,288 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:41,310 INFO L93 Difference]: Finished difference Result 511 states and 788 transitions. [2022-02-20 18:46:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 788 transitions. [2022-02-20 18:46:41,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:41,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:41,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:46:41,321 INFO L87 Difference]: Start difference. First operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:46:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:41,342 INFO L93 Difference]: Finished difference Result 511 states and 788 transitions. [2022-02-20 18:46:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 788 transitions. [2022-02-20 18:46:41,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:41,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:41,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:41,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2022-02-20 18:46:41,354 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 63 [2022-02-20 18:46:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:41,355 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2022-02-20 18:46:41,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2022-02-20 18:46:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:46:41,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:41,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:41,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:46:41,360 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash 473041692, now seen corresponding path program 1 times [2022-02-20 18:46:41,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:41,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429415326] [2022-02-20 18:46:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:41,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {2349#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {2349#true} is VALID [2022-02-20 18:46:41,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2349#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {2349#true} is VALID [2022-02-20 18:46:41,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2349#true} assume 0 == ~r1~0 % 256; {2349#true} is VALID [2022-02-20 18:46:41,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {2349#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#(<= (+ (* (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; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {2351#(<= (+ (* (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_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#(<= (+ (* (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); {2351#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:46:41,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {2351#(<= (+ (* (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); {2352#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:41,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {2352#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2352#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:41,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {2352#(<= (+ (* (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); {2352#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:46:41,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {2352#(<= (+ (* (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); {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:41,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:41,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:41,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:41,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {2353#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:41,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:41,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:41,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:41,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {2350#false} is VALID [2022-02-20 18:46:41,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {2350#false} assume !(~send4~0 != ~id4~0); {2350#false} is VALID [2022-02-20 18:46:41,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {2350#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2350#false} is VALID [2022-02-20 18:46:41,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {2350#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2350#false} is VALID [2022-02-20 18:46:41,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {2350#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {2350#false} is VALID [2022-02-20 18:46:41,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {2350#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {2350#false} assume !(0 == ~mode1~0 % 256); {2350#false} is VALID [2022-02-20 18:46:41,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {2350#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {2350#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2350#false} is VALID [2022-02-20 18:46:41,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {2350#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {2350#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {2350#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2350#false} is VALID [2022-02-20 18:46:41,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {2350#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {2350#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {2350#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2350#false} is VALID [2022-02-20 18:46:41,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {2350#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {2350#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2350#false} is VALID [2022-02-20 18:46:41,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {2350#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2350#false} is VALID [2022-02-20 18:46:41,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {2350#false} ~mode4~0 := 0; {2350#false} is VALID [2022-02-20 18:46:41,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {2350#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2350#false} is VALID [2022-02-20 18:46:41,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {2350#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2350#false} is VALID [2022-02-20 18:46:41,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {2350#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {2350#false} is VALID [2022-02-20 18:46:41,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {2350#false} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2350#false} is VALID [2022-02-20 18:46:41,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {2350#false} assume 0 == main_~assert__arg~1#1 % 256; {2350#false} is VALID [2022-02-20 18:46:41,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {2350#false} assume !false; {2350#false} is VALID [2022-02-20 18:46:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:46:41,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:41,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429415326] [2022-02-20 18:46:41,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429415326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:41,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:41,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:41,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870881662] [2022-02-20 18:46:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:46:41,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:41,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:41,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:41,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:41,668 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:43,253 INFO L93 Difference]: Finished difference Result 968 states and 1495 transitions. [2022-02-20 18:46:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:43,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:46:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2022-02-20 18:46:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2022-02-20 18:46:43,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 858 transitions. [2022-02-20 18:46:44,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 858 edges. 858 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:44,053 INFO L225 Difference]: With dead ends: 968 [2022-02-20 18:46:44,054 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 18:46:44,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:44,056 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 688 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:44,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 936 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 18:46:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 760. [2022-02-20 18:46:44,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:44,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,523 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,525 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:44,556 INFO L93 Difference]: Finished difference Result 766 states and 1167 transitions. [2022-02-20 18:46:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1167 transitions. [2022-02-20 18:46:44,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:44,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:44,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:46:44,562 INFO L87 Difference]: Start difference. First operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:46:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:44,592 INFO L93 Difference]: Finished difference Result 766 states and 1167 transitions. [2022-02-20 18:46:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1167 transitions. [2022-02-20 18:46:44,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:44,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:44,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:44,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1164 transitions. [2022-02-20 18:46:44,636 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1164 transitions. Word has length 64 [2022-02-20 18:46:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:44,637 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1164 transitions. [2022-02-20 18:46:44,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1164 transitions. [2022-02-20 18:46:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:46:44,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:44,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:44,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:46:44,639 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -222648813, now seen corresponding path program 1 times [2022-02-20 18:46:44,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:44,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713331891] [2022-02-20 18:46:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:44,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {6173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6175#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:44,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {6175#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6176#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:44,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {6176#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {6176#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:44,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {6176#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6177#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:44,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {6177#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6174#false} is VALID [2022-02-20 18:46:44,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {6174#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {6174#false} is VALID [2022-02-20 18:46:44,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {6174#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {6174#false} assume !!(0 == ~mode3~0 % 256); {6174#false} is VALID [2022-02-20 18:46:44,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {6174#false} assume !!(0 == ~alive3~0 % 256); {6174#false} is VALID [2022-02-20 18:46:44,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {6174#false} assume !(~send3~0 != ~id3~0); {6174#false} is VALID [2022-02-20 18:46:44,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {6174#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {6174#false} assume !!(0 == ~mode4~0 % 256); {6174#false} is VALID [2022-02-20 18:46:44,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {6174#false} assume !!(0 == ~alive4~0 % 256); {6174#false} is VALID [2022-02-20 18:46:44,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {6174#false} assume !(~send4~0 != ~id4~0); {6174#false} is VALID [2022-02-20 18:46:44,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {6174#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6174#false} is VALID [2022-02-20 18:46:44,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {6174#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6174#false} is VALID [2022-02-20 18:46:44,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {6174#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {6174#false} is VALID [2022-02-20 18:46:44,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {6174#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {6174#false} assume !(0 == ~mode1~0 % 256); {6174#false} is VALID [2022-02-20 18:46:44,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {6174#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {6174#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6174#false} is VALID [2022-02-20 18:46:44,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {6174#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {6174#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {6174#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6174#false} is VALID [2022-02-20 18:46:44,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {6174#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {6174#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {6174#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6174#false} is VALID [2022-02-20 18:46:44,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {6174#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {6174#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6174#false} is VALID [2022-02-20 18:46:44,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {6174#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {6174#false} is VALID [2022-02-20 18:46:44,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {6174#false} ~mode4~0 := 0; {6174#false} is VALID [2022-02-20 18:46:44,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {6174#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6174#false} is VALID [2022-02-20 18:46:44,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {6174#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6174#false} is VALID [2022-02-20 18:46:44,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {6174#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {6174#false} is VALID [2022-02-20 18:46:44,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {6174#false} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {6174#false} is VALID [2022-02-20 18:46:44,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {6174#false} assume 0 == main_~assert__arg~1#1 % 256; {6174#false} is VALID [2022-02-20 18:46:44,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {6174#false} assume !false; {6174#false} is VALID [2022-02-20 18:46:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:46:44,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:44,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713331891] [2022-02-20 18:46:44,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713331891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:44,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:44,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:44,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650894376] [2022-02-20 18:46:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:44,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:44,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:44,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:44,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:44,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:44,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:44,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:44,793 INFO L87 Difference]: Start difference. First operand 760 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:46,991 INFO L93 Difference]: Finished difference Result 2032 states and 3154 transitions. [2022-02-20 18:46:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-02-20 18:46:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-02-20 18:46:46,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 580 transitions. [2022-02-20 18:46:47,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:47,518 INFO L225 Difference]: With dead ends: 2032 [2022-02-20 18:46:47,519 INFO L226 Difference]: Without dead ends: 1318 [2022-02-20 18:46:47,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:46:47,521 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 940 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:47,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 235 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-02-20 18:46:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2022-02-20 18:46:48,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:48,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1318 states. Second operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:48,860 INFO L74 IsIncluded]: Start isIncluded. First operand 1318 states. Second operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:48,863 INFO L87 Difference]: Start difference. First operand 1318 states. Second operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:48,932 INFO L93 Difference]: Finished difference Result 1318 states and 2030 transitions. [2022-02-20 18:46:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2030 transitions. [2022-02-20 18:46:48,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:48,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:48,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 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 1318 states. [2022-02-20 18:46:48,939 INFO L87 Difference]: Start difference. First operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 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 1318 states. [2022-02-20 18:46:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:49,015 INFO L93 Difference]: Finished difference Result 1318 states and 2030 transitions. [2022-02-20 18:46:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2030 transitions. [2022-02-20 18:46:49,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:49,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:49,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:49,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 1.5429657794676805) internal successors, (2029), 1315 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2029 transitions. [2022-02-20 18:46:49,122 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2029 transitions. Word has length 65 [2022-02-20 18:46:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:49,122 INFO L470 AbstractCegarLoop]: Abstraction has 1316 states and 2029 transitions. [2022-02-20 18:46:49,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2029 transitions. [2022-02-20 18:46:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:46:49,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:49,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:49,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:46:49,126 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1106030069, now seen corresponding path program 1 times [2022-02-20 18:46:49,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:49,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814576618] [2022-02-20 18:46:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:49,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {13312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {13314#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:49,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {13314#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {13315#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:46:49,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {13315#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {13315#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:46:49,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {13315#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13316#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:46:49,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {13316#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13313#false} is VALID [2022-02-20 18:46:49,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {13313#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256); {13313#false} is VALID [2022-02-20 18:46:49,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {13313#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13313#false} is VALID [2022-02-20 18:46:49,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {13313#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13313#false} is VALID [2022-02-20 18:46:49,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {13313#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {13313#false} is VALID [2022-02-20 18:46:49,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {13313#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {13313#false} assume !(0 == ~mode1~0 % 256); {13313#false} is VALID [2022-02-20 18:46:49,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {13313#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {13313#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13313#false} is VALID [2022-02-20 18:46:49,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {13313#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {13313#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {13313#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {13313#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {13313#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {13313#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {13313#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {13313#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13313#false} is VALID [2022-02-20 18:46:49,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {13313#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13313#false} is VALID [2022-02-20 18:46:49,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {13313#false} ~mode4~0 := 0; {13313#false} is VALID [2022-02-20 18:46:49,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {13313#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13313#false} is VALID [2022-02-20 18:46:49,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {13313#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13313#false} is VALID [2022-02-20 18:46:49,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {13313#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {13313#false} is VALID [2022-02-20 18:46:49,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {13313#false} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {13313#false} is VALID [2022-02-20 18:46:49,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {13313#false} assume 0 == main_~assert__arg~1#1 % 256; {13313#false} is VALID [2022-02-20 18:46:49,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {13313#false} assume !false; {13313#false} is VALID [2022-02-20 18:46:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:46:49,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:49,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814576618] [2022-02-20 18:46:49,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814576618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:49,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:49,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:49,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841391433] [2022-02-20 18:46:49,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:49,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:49,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:49,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:49,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:49,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:49,324 INFO L87 Difference]: Start difference. First operand 1316 states and 2029 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:53,280 INFO L93 Difference]: Finished difference Result 3528 states and 5495 transitions. [2022-02-20 18:46:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2022-02-20 18:46:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2022-02-20 18:46:53,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 530 transitions. [2022-02-20 18:46:53,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:53,845 INFO L225 Difference]: With dead ends: 3528 [2022-02-20 18:46:53,845 INFO L226 Difference]: Without dead ends: 2308 [2022-02-20 18:46:53,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:46:53,848 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 866 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:53,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 241 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-02-20 18:46:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2306. [2022-02-20 18:46:56,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:56,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,659 INFO L74 IsIncluded]: Start isIncluded. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,661 INFO L87 Difference]: Start difference. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,811 INFO L93 Difference]: Finished difference Result 2308 states and 3568 transitions. [2022-02-20 18:46:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3568 transitions. [2022-02-20 18:46:56,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 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 2308 states. [2022-02-20 18:46:56,823 INFO L87 Difference]: Start difference. First operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 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 2308 states. [2022-02-20 18:46:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,973 INFO L93 Difference]: Finished difference Result 2308 states and 3568 transitions. [2022-02-20 18:46:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3568 transitions. [2022-02-20 18:46:56,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:56,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.5475054229934924) internal successors, (3567), 2305 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3567 transitions. [2022-02-20 18:46:57,215 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3567 transitions. Word has length 65 [2022-02-20 18:46:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:57,216 INFO L470 AbstractCegarLoop]: Abstraction has 2306 states and 3567 transitions. [2022-02-20 18:46:57,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3567 transitions. [2022-02-20 18:46:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:46:57,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:57,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:57,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:46:57,218 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 244768548, now seen corresponding path program 1 times [2022-02-20 18:46:57,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:57,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145049598] [2022-02-20 18:46:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:57,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {25881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {25883#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:57,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {25883#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {25884#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:46:57,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {25884#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {25884#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:46:57,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {25884#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25885#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:46:57,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {25885#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {25882#false} is VALID [2022-02-20 18:46:57,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {25882#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {25882#false} is VALID [2022-02-20 18:46:57,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {25882#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {25882#false} assume !!(0 == ~mode4~0 % 256); {25882#false} is VALID [2022-02-20 18:46:57,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {25882#false} assume !!(0 == ~alive4~0 % 256); {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {25882#false} assume !(~send4~0 != ~id4~0); {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {25882#false} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {25882#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {25882#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {25882#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {25882#false} assume !(0 == ~mode1~0 % 256); {25882#false} is VALID [2022-02-20 18:46:57,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {25882#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {25882#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {25882#false} is VALID [2022-02-20 18:46:57,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {25882#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {25882#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {25882#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {25882#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {25882#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {25882#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {25882#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {25882#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25882#false} is VALID [2022-02-20 18:46:57,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {25882#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {25882#false} ~mode4~0 := 0; {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {25882#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {25882#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {25882#false} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {25882#false} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {25882#false} is VALID [2022-02-20 18:46:57,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {25882#false} assume 0 == main_~assert__arg~1#1 % 256; {25882#false} is VALID [2022-02-20 18:46:57,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {25882#false} assume !false; {25882#false} is VALID [2022-02-20 18:46:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:46:57,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:57,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145049598] [2022-02-20 18:46:57,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145049598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:57,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:57,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:57,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236403534] [2022-02-20 18:46:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:46:57,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:57,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:57,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:57,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:57,351 INFO L87 Difference]: Start difference. First operand 2306 states and 3567 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:06,027 INFO L93 Difference]: Finished difference Result 6569 states and 10218 transitions. [2022-02-20 18:47:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:47:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-02-20 18:47:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-02-20 18:47:06,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 550 transitions. [2022-02-20 18:47:06,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:07,158 INFO L225 Difference]: With dead ends: 6569 [2022-02-20 18:47:07,158 INFO L226 Difference]: Without dead ends: 4332 [2022-02-20 18:47:07,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:47:07,162 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 896 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:07,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 237 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2022-02-20 18:47:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4330. [2022-02-20 18:47:13,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:13,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4332 states. Second operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call 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:13,651 INFO L74 IsIncluded]: Start isIncluded. First operand 4332 states. Second operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call 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:13,656 INFO L87 Difference]: Start difference. First operand 4332 states. Second operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call 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:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:14,217 INFO L93 Difference]: Finished difference Result 4332 states and 6692 transitions. [2022-02-20 18:47:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 6692 transitions. [2022-02-20 18:47:14,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:14,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:14,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 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 4332 states. [2022-02-20 18:47:14,237 INFO L87 Difference]: Start difference. First operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 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 4332 states. [2022-02-20 18:47:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:14,809 INFO L93 Difference]: Finished difference Result 4332 states and 6692 transitions. [2022-02-20 18:47:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 6692 transitions. [2022-02-20 18:47:14,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:14,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:14,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:14,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call 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,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6691 transitions. [2022-02-20 18:47:15,635 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6691 transitions. Word has length 65 [2022-02-20 18:47:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:15,635 INFO L470 AbstractCegarLoop]: Abstraction has 4330 states and 6691 transitions. [2022-02-20 18:47:15,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6691 transitions. [2022-02-20 18:47:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:47:15,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:15,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:15,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:47:15,638 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2050472616, now seen corresponding path program 1 times [2022-02-20 18:47:15,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:15,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435594366] [2022-02-20 18:47:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:15,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {49513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10664~0 := 0;~__return_10824~0 := 0; {49513#true} is VALID [2022-02-20 18:47:15,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {49513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__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; {49513#true} is VALID [2022-02-20 18:47:15,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {49513#true} assume 0 == ~r1~0 % 256; {49513#true} is VALID [2022-02-20 18:47:15,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {49513#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {49513#true} is VALID [2022-02-20 18:47:15,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {49513#true} assume ~id1~0 >= 0; {49513#true} is VALID [2022-02-20 18:47:15,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {49513#true} assume 0 == ~st1~0; {49513#true} is VALID [2022-02-20 18:47:15,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {49513#true} assume ~send1~0 == ~id1~0; {49513#true} is VALID [2022-02-20 18:47:15,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {49513#true} assume 0 == ~mode1~0 % 256; {49513#true} is VALID [2022-02-20 18:47:15,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {49513#true} assume ~id2~0 >= 0; {49513#true} is VALID [2022-02-20 18:47:15,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {49513#true} assume 0 == ~st2~0; {49513#true} is VALID [2022-02-20 18:47:15,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {49513#true} assume ~send2~0 == ~id2~0; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {49513#true} assume 0 == ~mode2~0 % 256; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {49513#true} assume ~id3~0 >= 0; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {49513#true} assume 0 == ~st3~0; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {49513#true} assume ~send3~0 == ~id3~0; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {49513#true} assume 0 == ~mode3~0 % 256; {49513#true} is VALID [2022-02-20 18:47:15,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {49513#true} assume ~id4~0 >= 0; {49513#true} is VALID [2022-02-20 18:47:15,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {49513#true} assume 0 == ~st4~0; {49513#true} is VALID [2022-02-20 18:47:15,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {49513#true} assume ~send4~0 == ~id4~0; {49513#true} is VALID [2022-02-20 18:47:15,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {49513#true} assume 0 == ~mode4~0 % 256; {49513#true} is VALID [2022-02-20 18:47:15,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {49513#true} assume ~id1~0 != ~id2~0; {49513#true} is VALID [2022-02-20 18:47:15,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {49513#true} assume ~id1~0 != ~id3~0; {49513#true} is VALID [2022-02-20 18:47:15,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {49513#true} assume ~id1~0 != ~id4~0; {49513#true} is VALID [2022-02-20 18:47:15,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {49513#true} assume ~id2~0 != ~id3~0; {49513#true} is VALID [2022-02-20 18:47:15,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {49513#true} assume ~id2~0 != ~id4~0; {49513#true} is VALID [2022-02-20 18:47:15,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {49513#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {49515#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:47:15,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {49515#(= |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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {49513#true} assume !!(0 == ~mode1~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {49513#true} assume !!(0 == ~alive1~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {49513#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {49513#true} assume !!(0 == ~mode2~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {49513#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {49513#true} assume ~send2~0 != ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {49513#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {49513#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {49513#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {49513#true} assume !!(0 == ~mode3~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {49513#true} assume !!(0 == ~alive3~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {49513#true} assume !(~send3~0 != ~id3~0); {49513#true} is VALID [2022-02-20 18:47:15,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {49513#true} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {49513#true} assume !!(0 == ~mode4~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {49513#true} assume !!(0 == ~alive4~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {49513#true} assume !(~send4~0 != ~id4~0); {49513#true} is VALID [2022-02-20 18:47:15,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {49513#true} ~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {49513#true} is VALID [2022-02-20 18:47:15,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {49513#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49513#true} is VALID [2022-02-20 18:47:15,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {49513#true} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_10664~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10664~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; {49513#true} is VALID [2022-02-20 18:47:15,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {49513#true} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {49513#true} assume !(0 == ~mode1~0 % 256); {49513#true} is VALID [2022-02-20 18:47:15,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {49513#true} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {49513#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {49513#true} is VALID [2022-02-20 18:47:15,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {49513#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {49513#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {49513#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {49513#true} is VALID [2022-02-20 18:47:15,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {49513#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {49513#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {49513#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {49513#true} is VALID [2022-02-20 18:47:15,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {49513#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {49513#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {49513#true} is VALID [2022-02-20 18:47:15,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {49513#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {49513#true} is VALID [2022-02-20 18:47:15,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {49513#true} ~mode4~0 := 0; {49513#true} is VALID [2022-02-20 18:47:15,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {49513#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~1#1; {49513#true} is VALID [2022-02-20 18:47:15,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {49513#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49513#true} is VALID [2022-02-20 18:47:15,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {49513#true} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {49516#(not (= |ULTIMATE.start_main_~check__tmp~1#1| 0))} is VALID [2022-02-20 18:47:15,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {49516#(not (= |ULTIMATE.start_main_~check__tmp~1#1| 0))} ~__return_10824~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_10824~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {49517#(and (<= (div |ULTIMATE.start_main_~assert__arg~1#1| 256) 0) (<= 1 |ULTIMATE.start_main_~assert__arg~1#1|))} is VALID [2022-02-20 18:47:15,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {49517#(and (<= (div |ULTIMATE.start_main_~assert__arg~1#1| 256) 0) (<= 1 |ULTIMATE.start_main_~assert__arg~1#1|))} assume 0 == main_~assert__arg~1#1 % 256; {49514#false} is VALID [2022-02-20 18:47:15,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {49514#false} assume !false; {49514#false} is VALID [2022-02-20 18:47:15,826 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:15,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:15,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435594366] [2022-02-20 18:47:15,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435594366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:15,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:15,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:47:15,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834249127] [2022-02-20 18:47:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:47:15,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:15,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:15,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:15,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:15,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:15,882 INFO L87 Difference]: Start difference. First operand 4330 states and 6691 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:33,210 INFO L93 Difference]: Finished difference Result 8380 states and 12940 transitions. [2022-02-20 18:47:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:47:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-02-20 18:47:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-02-20 18:47:33,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 359 transitions. [2022-02-20 18:47:33,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.