./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.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 0bbf22098def83a979a93dd8fa66adb7d528ee9621686d1c01784de1384e9197
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 19:45:25,192 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-20 19:45:25,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 19:45:25,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 19:45:25,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 19:45:25,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 19:45:25,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 19:45:25,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 19:45:25,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 19:45:25,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 19:45:25,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 19:45:25,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 19:45:25,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 19:45:25,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 19:45:25,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 19:45:25,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 19:45:25,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 19:45:25,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 19:45:25,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 19:45:25,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 19:45:25,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 19:45:25,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 19:45:25,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 19:45:25,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 19:45:25,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 19:45:25,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 19:45:25,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 19:45:25,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 19:45:25,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 19:45:25,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 19:45:25,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 19:45:25,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 19:45:25,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 19:45:25,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 19:45:25,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 19:45:25,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 19:45:25,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 19:45:25,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 19:45:25,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 19:45:25,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 19:45:25,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 19:45:25,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-02-20 19:45:25,312 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-20 19:45:25,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 19:45:25,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 19:45:25,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 19:45:25,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 19:45:25,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 19:45:25,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 19:45:25,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-20 19:45:25,315 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-20 19:45:25,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 19:45:25,316 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-20 19:45:25,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-20 19:45:25,317 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-20 19:45:25,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-20 19:45:25,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 19:45:25,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 19:45:25,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 19:45:25,318 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-20 19:45:25,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-20 19:45:25,318 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-20 19:45:25,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-20 19:45:25,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 19:45:25,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-20 19:45:25,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-20 19:45:25,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 19:45:25,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 19:45:25,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 19:45:25,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 19:45:25,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-20 19:45:25,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-20 19:45:25,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-20 19:45:25,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 19:45:25,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 19:45:25,321 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 -> 0bbf22098def83a979a93dd8fa66adb7d528ee9621686d1c01784de1384e9197
[2022-02-20 19:45:25,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 19:45:25,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 19:45:25,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 19:45:25,524 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-20 19:45:25,525 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-20 19:45:25,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c
[2022-02-20 19:45:25,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335794c5/c28f829aa48447c28b5e6b7dce2c5dcf/FLAG071abe9b5
[2022-02-20 19:45:26,286 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-20 19:45:26,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c
[2022-02-20 19:45:26,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335794c5/c28f829aa48447c28b5e6b7dce2c5dcf/FLAG071abe9b5
[2022-02-20 19:45:26,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335794c5/c28f829aa48447c28b5e6b7dce2c5dcf
[2022-02-20 19:45:26,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 19:45:26,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 19:45:26,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 19:45:26,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 19:45:26,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 19:45:26,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:26" (1/1) ...
[2022-02-20 19:45:26,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4b6a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:26, skipping insertion in model container
[2022-02-20 19:45:26,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:26" (1/1) ...
[2022-02-20 19:45:26,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-20 19:45:26,668 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-20 19:45:26,958 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c[11668,11681]
[2022-02-20 19:45:27,031 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c[19416,19429]
[2022-02-20 19:45:27,684 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 19:45:27,697 INFO L203 MainTranslator]: Completed pre-run
[2022-02-20 19:45:27,734 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c[11668,11681]
[2022-02-20 19:45:27,748 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c[19416,19429]
[2022-02-20 19:45:28,137 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 19:45:28,170 INFO L208 MainTranslator]: Completed translation
[2022-02-20 19:45:28,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28 WrapperNode
[2022-02-20 19:45:28,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 19:45:28,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 19:45:28,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 19:45:28,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 19:45:28,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,744 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5088
[2022-02-20 19:45:28,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 19:45:28,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 19:45:28,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 19:45:28,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 19:45:28,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:28,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:29,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:29,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:29,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 19:45:29,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 19:45:29,095 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 19:45:29,095 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-20 19:45:29,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (1/1) ...
[2022-02-20 19:45:29,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 19:45:29,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 19:45:29,128 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 19:45:29,155 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 19:45:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 19:45:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-20 19:45:29,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 19:45:29,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 19:45:29,323 INFO L234 CfgBuilder]: Building ICFG
[2022-02-20 19:45:29,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 19:45:37,423 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-20 19:45:37,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 19:45:37,439 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-02-20 19:45:37,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:37 BoogieIcfgContainer
[2022-02-20 19:45:37,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 19:45:37,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 19:45:37,443 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 19:45:37,449 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-20 19:45:37,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:45:26" (1/3) ...
[2022-02-20 19:45:37,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9c44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:37, skipping insertion in model container
[2022-02-20 19:45:37,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:28" (2/3) ...
[2022-02-20 19:45:37,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9c44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:37, skipping insertion in model container
[2022-02-20 19:45:37,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:37" (3/3) ...
[2022-02-20 19:45:37,451 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c
[2022-02-20 19:45:37,455 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 19:45:37,456 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-20 19:45:37,495 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 19:45:37,500 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 19:45:37,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2022-02-20 19:45:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-02-20 19:45:37,545 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:45:37,545 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]
[2022-02-20 19:45:37,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:45:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:45:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1083425478, now seen corresponding path program 1 times
[2022-02-20 19:45:37,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:45:37,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357693299]
[2022-02-20 19:45:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:45:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:45:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:45:37,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {914#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {914#true} is VALID
[2022-02-20 19:45:37,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {914#true} is VALID
[2022-02-20 19:45:37,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {914#true} is VALID
[2022-02-20 19:45:37,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {914#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {914#true} is VALID
[2022-02-20 19:45:37,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#true} init_#res#1 := init_~tmp~0#1; {914#true} is VALID
[2022-02-20 19:45:37,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {914#true} is VALID
[2022-02-20 19:45:37,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {915#false} is VALID
[2022-02-20 19:45:37,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#false} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {915#false} is VALID
[2022-02-20 19:45:37,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {915#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#false} assume !(0 != ~mode1~0 % 256); {915#false} is VALID
[2022-02-20 19:45:37,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {915#false} is VALID
[2022-02-20 19:45:37,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {915#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {915#false} is VALID
[2022-02-20 19:45:37,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {915#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#false} assume !(0 != ~mode2~0 % 256); {915#false} is VALID
[2022-02-20 19:45:37,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {915#false} is VALID
[2022-02-20 19:45:37,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {915#false} is VALID
[2022-02-20 19:45:37,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {915#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} assume !(0 != ~mode3~0 % 256); {915#false} is VALID
[2022-02-20 19:45:37,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {915#false} is VALID
[2022-02-20 19:45:37,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {915#false} is VALID
[2022-02-20 19:45:37,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {915#false} assume !(0 != ~mode4~0 % 256); {915#false} is VALID
[2022-02-20 19:45:37,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {915#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {915#false} is VALID
[2022-02-20 19:45:37,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {915#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {915#false} is VALID
[2022-02-20 19:45:37,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {915#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {915#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {915#false} is VALID
[2022-02-20 19:45:37,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {915#false} assume !(node5_~m5~0#1 != ~nomsg~0); {915#false} is VALID
[2022-02-20 19:45:37,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {915#false} ~mode5~0 := 0; {915#false} is VALID
[2022-02-20 19:45:37,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {915#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {915#false} is VALID
[2022-02-20 19:45:37,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {915#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {915#false} is VALID
[2022-02-20 19:45:37,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {915#false} check_#res#1 := check_~tmp~1#1; {915#false} is VALID
[2022-02-20 19:45:37,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {915#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {915#false} is VALID
[2022-02-20 19:45:37,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {915#false} assume 0 == assert_~arg#1 % 256; {915#false} is VALID
[2022-02-20 19:45:37,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {915#false} assume !false; {915#false} is VALID
[2022-02-20 19:45:37,840 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 19:45:37,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:45:37,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357693299]
[2022-02-20 19:45:37,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357693299] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:45:37,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:45:37,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-20 19:45:37,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165540463]
[2022-02-20 19:45:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:45:37,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2022-02-20 19:45:37,851 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:45:37,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:37,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:37,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-20 19:45:37,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:45:37,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-20 19:45:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 19:45:37,927 INFO L87 Difference]: Start difference. First operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:39,289 INFO L93 Difference]: Finished difference Result 1783 states and 3378 transitions.
[2022-02-20 19:45:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-20 19:45:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2022-02-20 19:45:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:45:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3378 transitions.
[2022-02-20 19:45:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3378 transitions.
[2022-02-20 19:45:39,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3378 transitions.
[2022-02-20 19:45:42,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3378 edges. 3378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:42,132 INFO L225 Difference]: With dead ends: 1783
[2022-02-20 19:45:42,133 INFO L226 Difference]: Without dead ends: 845
[2022-02-20 19:45:42,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 19:45:42,141 INFO L933 BasicCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:45:42,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:45:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states.
[2022-02-20 19:45:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845.
[2022-02-20 19:45:42,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:45:42,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,217 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,219 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:42,258 INFO L93 Difference]: Finished difference Result 845 states and 1592 transitions.
[2022-02-20 19:45:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions.
[2022-02-20 19:45:42,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:42,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:42,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 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 845 states.
[2022-02-20 19:45:42,267 INFO L87 Difference]: Start difference. First operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 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 845 states.
[2022-02-20 19:45:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:42,305 INFO L93 Difference]: Finished difference Result 845 states and 1592 transitions.
[2022-02-20 19:45:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions.
[2022-02-20 19:45:42,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:42,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:42,307 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:45:42,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:45:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1592 transitions.
[2022-02-20 19:45:42,349 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1592 transitions. Word has length 34
[2022-02-20 19:45:42,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:45:42,350 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1592 transitions.
[2022-02-20 19:45:42,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions.
[2022-02-20 19:45:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-02-20 19:45:42,351 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:45:42,351 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]
[2022-02-20 19:45:42,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-20 19:45:42,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:45:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:45:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1592898568, now seen corresponding path program 1 times
[2022-02-20 19:45:42,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:45:42,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720879300]
[2022-02-20 19:45:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:45:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:45:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:45:42,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {5280#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5280#true} is VALID
[2022-02-20 19:45:42,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {5280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {5280#true} is VALID
[2022-02-20 19:45:42,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {5280#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5280#true} is VALID
[2022-02-20 19:45:42,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {5280#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5282#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID
[2022-02-20 19:45:42,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {5282#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5283#(= |ULTIMATE.start_init_#res#1| 0)} is VALID
[2022-02-20 19:45:42,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5284#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID
[2022-02-20 19:45:42,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {5284#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5281#false} is VALID
[2022-02-20 19:45:42,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {5281#false} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5281#false} is VALID
[2022-02-20 19:45:42,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {5281#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {5281#false} assume !(0 != ~mode1~0 % 256); {5281#false} is VALID
[2022-02-20 19:45:42,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {5281#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5281#false} is VALID
[2022-02-20 19:45:42,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {5281#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5281#false} is VALID
[2022-02-20 19:45:42,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {5281#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {5281#false} assume !(0 != ~mode2~0 % 256); {5281#false} is VALID
[2022-02-20 19:45:42,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {5281#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5281#false} is VALID
[2022-02-20 19:45:42,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {5281#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {5281#false} is VALID
[2022-02-20 19:45:42,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {5281#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {5281#false} assume !(0 != ~mode3~0 % 256); {5281#false} is VALID
[2022-02-20 19:45:42,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {5281#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5281#false} is VALID
[2022-02-20 19:45:42,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {5281#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {5281#false} is VALID
[2022-02-20 19:45:42,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {5281#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {5281#false} assume !(0 != ~mode4~0 % 256); {5281#false} is VALID
[2022-02-20 19:45:42,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {5281#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5281#false} is VALID
[2022-02-20 19:45:42,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {5281#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5281#false} is VALID
[2022-02-20 19:45:42,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {5281#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {5281#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5281#false} is VALID
[2022-02-20 19:45:42,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {5281#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5281#false} is VALID
[2022-02-20 19:45:42,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {5281#false} ~mode5~0 := 0; {5281#false} is VALID
[2022-02-20 19:45:42,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {5281#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5281#false} is VALID
[2022-02-20 19:45:42,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {5281#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5281#false} is VALID
[2022-02-20 19:45:42,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {5281#false} check_#res#1 := check_~tmp~1#1; {5281#false} is VALID
[2022-02-20 19:45:42,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {5281#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5281#false} is VALID
[2022-02-20 19:45:42,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {5281#false} assume 0 == assert_~arg#1 % 256; {5281#false} is VALID
[2022-02-20 19:45:42,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {5281#false} assume !false; {5281#false} is VALID
[2022-02-20 19:45:42,441 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 19:45:42,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:45:42,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720879300]
[2022-02-20 19:45:42,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720879300] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:45:42,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:45:42,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 19:45:42,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010569300]
[2022-02-20 19:45:42,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:45:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2022-02-20 19:45:42,444 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:45:42,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:42,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:42,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 19:45:42,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:45:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 19:45:42,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 19:45:42,470 INFO L87 Difference]: Start difference. First operand 845 states and 1592 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:46,681 INFO L93 Difference]: Finished difference Result 903 states and 1681 transitions.
[2022-02-20 19:45:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-02-20 19:45:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2022-02-20 19:45:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:45:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions.
[2022-02-20 19:45:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions.
[2022-02-20 19:45:46,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1681 transitions.
[2022-02-20 19:45:48,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1681 edges. 1681 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:48,086 INFO L225 Difference]: With dead ends: 903
[2022-02-20 19:45:48,087 INFO L226 Difference]: Without dead ends: 845
[2022-02-20 19:45:48,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2022-02-20 19:45:48,093 INFO L933 BasicCegarLoop]: 1590 mSDtfsCounter, 3 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6326 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:45:48,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6326 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:45:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states.
[2022-02-20 19:45:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845.
[2022-02-20 19:45:48,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:45:48,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:48,124 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:48,126 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:48,162 INFO L93 Difference]: Finished difference Result 845 states and 1561 transitions.
[2022-02-20 19:45:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions.
[2022-02-20 19:45:48,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:48,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:48,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 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 845 states.
[2022-02-20 19:45:48,169 INFO L87 Difference]: Start difference. First operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 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 845 states.
[2022-02-20 19:45:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:48,207 INFO L93 Difference]: Finished difference Result 845 states and 1561 transitions.
[2022-02-20 19:45:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions.
[2022-02-20 19:45:48,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:48,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:48,210 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:45:48,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:45:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1561 transitions.
[2022-02-20 19:45:48,256 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1561 transitions. Word has length 34
[2022-02-20 19:45:48,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:45:48,256 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1561 transitions.
[2022-02-20 19:45:48,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions.
[2022-02-20 19:45:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2022-02-20 19:45:48,260 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:45:48,261 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 19:45:48,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-20 19:45:48,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:45:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:45:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1337087153, now seen corresponding path program 1 times
[2022-02-20 19:45:48,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:45:48,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157372279]
[2022-02-20 19:45:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:45:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:45:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:45:48,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {8766#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8766#true} is VALID
[2022-02-20 19:45:48,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {8766#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {8766#true} is VALID
[2022-02-20 19:45:48,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {8766#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8766#true} is VALID
[2022-02-20 19:45:48,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {8766#true} assume 0 == ~r1~0 % 256; {8766#true} is VALID
[2022-02-20 19:45:48,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {8766#true} assume ~id1~0 >= 0; {8766#true} is VALID
[2022-02-20 19:45:48,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {8766#true} assume 0 == ~st1~0; {8766#true} is VALID
[2022-02-20 19:45:48,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {8766#true} assume ~send1~0 == ~id1~0; {8766#true} is VALID
[2022-02-20 19:45:48,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8766#true} assume 0 == ~mode1~0 % 256; {8766#true} is VALID
[2022-02-20 19:45:48,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {8766#true} assume ~id2~0 >= 0; {8766#true} is VALID
[2022-02-20 19:45:48,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {8766#true} assume 0 == ~st2~0; {8766#true} is VALID
[2022-02-20 19:45:48,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {8766#true} assume ~send2~0 == ~id2~0; {8766#true} is VALID
[2022-02-20 19:45:48,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {8766#true} assume 0 == ~mode2~0 % 256; {8766#true} is VALID
[2022-02-20 19:45:48,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {8766#true} assume ~id3~0 >= 0; {8766#true} is VALID
[2022-02-20 19:45:48,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8766#true} assume 0 == ~st3~0; {8766#true} is VALID
[2022-02-20 19:45:48,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {8766#true} assume ~send3~0 == ~id3~0; {8766#true} is VALID
[2022-02-20 19:45:48,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {8766#true} assume 0 == ~mode3~0 % 256; {8766#true} is VALID
[2022-02-20 19:45:48,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {8766#true} assume ~id4~0 >= 0; {8766#true} is VALID
[2022-02-20 19:45:48,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {8766#true} assume 0 == ~st4~0; {8766#true} is VALID
[2022-02-20 19:45:48,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {8766#true} assume ~send4~0 == ~id4~0; {8766#true} is VALID
[2022-02-20 19:45:48,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {8766#true} assume 0 == ~mode4~0 % 256; {8766#true} is VALID
[2022-02-20 19:45:48,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {8766#true} assume ~id5~0 >= 0; {8766#true} is VALID
[2022-02-20 19:45:48,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {8766#true} assume 0 == ~st5~0; {8766#true} is VALID
[2022-02-20 19:45:48,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {8766#true} assume ~send5~0 == ~id5~0; {8766#true} is VALID
[2022-02-20 19:45:48,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {8766#true} assume 0 == ~mode5~0 % 256; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 19:45:48,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {8768#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8767#false} is VALID
[2022-02-20 19:45:48,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {8767#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8767#false} is VALID
[2022-02-20 19:45:48,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {8767#false} ~mode5~0 := 0; {8767#false} is VALID
[2022-02-20 19:45:48,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {8767#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8767#false} is VALID
[2022-02-20 19:45:48,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {8767#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {8767#false} is VALID
[2022-02-20 19:45:48,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {8767#false} check_#res#1 := check_~tmp~1#1; {8767#false} is VALID
[2022-02-20 19:45:48,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {8767#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8767#false} is VALID
[2022-02-20 19:45:48,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {8767#false} assume 0 == assert_~arg#1 % 256; {8767#false} is VALID
[2022-02-20 19:45:48,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {8767#false} assume !false; {8767#false} is VALID
[2022-02-20 19:45:48,506 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 19:45:48,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:45:48,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157372279]
[2022-02-20 19:45:48,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157372279] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:45:48,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:45:48,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:45:48,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883787638]
[2022-02-20 19:45:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:45:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:48,509 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:45:48,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:48,564 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 19:45:48,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:45:48,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:45:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:45:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:45:48,566 INFO L87 Difference]: Start difference. First operand 845 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:50,449 INFO L93 Difference]: Finished difference Result 947 states and 1721 transitions.
[2022-02-20 19:45:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:45:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:45:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:45:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:45:50,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions.
[2022-02-20 19:45:52,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:52,182 INFO L225 Difference]: With dead ends: 947
[2022-02-20 19:45:52,182 INFO L226 Difference]: Without dead ends: 893
[2022-02-20 19:45:52,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:45:52,184 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1498 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:45:52,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1676 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:45:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states.
[2022-02-20 19:45:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891.
[2022-02-20 19:45:52,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:45:52,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 893 states. Second operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:52,202 INFO L74 IsIncluded]: Start isIncluded. First operand 893 states. Second operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:52,204 INFO L87 Difference]: Start difference. First operand 893 states. Second operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:52,244 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions.
[2022-02-20 19:45:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1635 transitions.
[2022-02-20 19:45:52,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:52,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:52,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 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 893 states.
[2022-02-20 19:45:52,250 INFO L87 Difference]: Start difference. First operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 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 893 states.
[2022-02-20 19:45:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:52,288 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions.
[2022-02-20 19:45:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1635 transitions.
[2022-02-20 19:45:52,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:52,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:52,290 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:45:52,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:45:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8380202474690663) internal successors, (1634), 890 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1634 transitions.
[2022-02-20 19:45:52,332 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1634 transitions. Word has length 64
[2022-02-20 19:45:52,333 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:45:52,333 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1634 transitions.
[2022-02-20 19:45:52,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 19:45:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1634 transitions.
[2022-02-20 19:45:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2022-02-20 19:45:52,334 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:45:52,334 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 19:45:52,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-20 19:45:52,335 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:45:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:45:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -119101755, now seen corresponding path program 1 times
[2022-02-20 19:45:52,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:45:52,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486774053]
[2022-02-20 19:45:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:45:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:45:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:45:52,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {12447#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {12447#true} is VALID
[2022-02-20 19:45:52,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {12447#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {12447#true} is VALID
[2022-02-20 19:45:52,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {12447#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12447#true} is VALID
[2022-02-20 19:45:52,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {12447#true} assume 0 == ~r1~0 % 256; {12447#true} is VALID
[2022-02-20 19:45:52,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {12447#true} assume ~id1~0 >= 0; {12447#true} is VALID
[2022-02-20 19:45:52,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {12447#true} assume 0 == ~st1~0; {12449#(<= ~st1~0 0)} is VALID
[2022-02-20 19:45:52,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {12449#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {12449#(<= ~st1~0 0)} is VALID
[2022-02-20 19:45:52,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {12449#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {12449#(<= ~st1~0 0)} is VALID
[2022-02-20 19:45:52,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {12449#(<= ~st1~0 0)} assume ~id2~0 >= 0; {12449#(<= ~st1~0 0)} is VALID
[2022-02-20 19:45:52,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {12449#(<= ~st1~0 0)} assume 0 == ~st2~0; {12450#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {12450#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {12450#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {12450#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {12450#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {12450#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {12450#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {12450#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {12451#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {12452#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:45:52,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {12453#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {12448#false} is VALID
[2022-02-20 19:45:52,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {12448#false} check_#res#1 := check_~tmp~1#1; {12448#false} is VALID
[2022-02-20 19:45:52,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {12448#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12448#false} is VALID
[2022-02-20 19:45:52,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {12448#false} assume 0 == assert_~arg#1 % 256; {12448#false} is VALID
[2022-02-20 19:45:52,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {12448#false} assume !false; {12448#false} is VALID
[2022-02-20 19:45:52,467 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 19:45:52,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:45:52,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486774053]
[2022-02-20 19:45:52,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486774053] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:45:52,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:45:52,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-20 19:45:52,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939129423]
[2022-02-20 19:45:52,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:45:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:52,469 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:45:52,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:52,521 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 19:45:52,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-20 19:45:52,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:45:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-20 19:45:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-02-20 19:45:52,523 INFO L87 Difference]: Start difference. First operand 891 states and 1634 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:57,303 INFO L93 Difference]: Finished difference Result 1891 states and 3214 transitions.
[2022-02-20 19:45:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-20 19:45:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:45:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions.
[2022-02-20 19:45:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions.
[2022-02-20 19:45:57,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2411 transitions.
[2022-02-20 19:45:59,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2411 edges. 2411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:45:59,464 INFO L225 Difference]: With dead ends: 1891
[2022-02-20 19:45:59,464 INFO L226 Difference]: Without dead ends: 1791
[2022-02-20 19:45:59,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2022-02-20 19:45:59,465 INFO L933 BasicCegarLoop]: 1555 mSDtfsCounter, 8419 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8419 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-20 19:45:59,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8419 Valid, 2463 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-20 19:45:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states.
[2022-02-20 19:45:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 989.
[2022-02-20 19:45:59,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:45:59,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1791 states. Second operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:59,563 INFO L74 IsIncluded]: Start isIncluded. First operand 1791 states. Second operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:59,565 INFO L87 Difference]: Start difference. First operand 1791 states. Second operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:59,693 INFO L93 Difference]: Finished difference Result 1791 states and 3036 transitions.
[2022-02-20 19:45:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3036 transitions.
[2022-02-20 19:45:59,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:59,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:59,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 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 1791 states.
[2022-02-20 19:45:59,700 INFO L87 Difference]: Start difference. First operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 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 1791 states.
[2022-02-20 19:45:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:45:59,791 INFO L93 Difference]: Finished difference Result 1791 states and 3036 transitions.
[2022-02-20 19:45:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3036 transitions.
[2022-02-20 19:45:59,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:45:59,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:45:59,793 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:45:59,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:45:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 987 states have (on average 1.8105369807497467) internal successors, (1787), 988 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:45:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1787 transitions.
[2022-02-20 19:45:59,840 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1787 transitions. Word has length 64
[2022-02-20 19:45:59,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:45:59,841 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1787 transitions.
[2022-02-20 19:45:59,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 19:45:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1787 transitions.
[2022-02-20 19:45:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 19:45:59,842 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:45:59,842 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 19:45:59,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-20 19:45:59,842 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:45:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:45:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 91634997, now seen corresponding path program 1 times
[2022-02-20 19:45:59,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:45:59,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720912960]
[2022-02-20 19:45:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:45:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:45:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:45:59,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {19153#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {19153#true} is VALID
[2022-02-20 19:45:59,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {19153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {19153#true} is VALID
[2022-02-20 19:45:59,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {19153#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19153#true} is VALID
[2022-02-20 19:45:59,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {19153#true} assume 0 == ~r1~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 19:45:59,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {19155#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {19154#false} is VALID
[2022-02-20 19:45:59,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {19154#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {19154#false} is VALID
[2022-02-20 19:45:59,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {19154#false} check_#res#1 := check_~tmp~1#1; {19154#false} is VALID
[2022-02-20 19:45:59,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {19154#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {19154#false} is VALID
[2022-02-20 19:45:59,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {19154#false} assume 0 == assert_~arg#1 % 256; {19154#false} is VALID
[2022-02-20 19:45:59,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {19154#false} assume !false; {19154#false} is VALID
[2022-02-20 19:45:59,968 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 19:45:59,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:45:59,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720912960]
[2022-02-20 19:45:59,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720912960] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:45:59,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:45:59,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:45:59,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748623956]
[2022-02-20 19:45:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:45:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:59,970 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:45:59,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:00,014 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 19:46:00,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:46:00,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:46:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:46:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:00,015 INFO L87 Difference]: Start difference. First operand 989 states and 1787 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:01,572 INFO L93 Difference]: Finished difference Result 1363 states and 2371 transitions.
[2022-02-20 19:46:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:46:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:46:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions.
[2022-02-20 19:46:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions.
[2022-02-20 19:46:01,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1722 transitions.
[2022-02-20 19:46:03,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:46:03,082 INFO L225 Difference]: With dead ends: 1363
[2022-02-20 19:46:03,082 INFO L226 Difference]: Without dead ends: 1165
[2022-02-20 19:46:03,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:03,084 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:46:03,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1635 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:46:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states.
[2022-02-20 19:46:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1159.
[2022-02-20 19:46:03,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:46:03,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1165 states. Second operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:03,268 INFO L74 IsIncluded]: Start isIncluded. First operand 1165 states. Second operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:03,270 INFO L87 Difference]: Start difference. First operand 1165 states. Second operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:03,326 INFO L93 Difference]: Finished difference Result 1165 states and 2050 transitions.
[2022-02-20 19:46:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2050 transitions.
[2022-02-20 19:46:03,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:03,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:03,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 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 1165 states.
[2022-02-20 19:46:03,333 INFO L87 Difference]: Start difference. First operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 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 1165 states.
[2022-02-20 19:46:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:03,392 INFO L93 Difference]: Finished difference Result 1165 states and 2050 transitions.
[2022-02-20 19:46:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2050 transitions.
[2022-02-20 19:46:03,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:03,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:03,395 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:46:03,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:46:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 1.7675021607605876) internal successors, (2045), 1158 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2045 transitions.
[2022-02-20 19:46:03,460 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2045 transitions. Word has length 66
[2022-02-20 19:46:03,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:46:03,461 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 2045 transitions.
[2022-02-20 19:46:03,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2045 transitions.
[2022-02-20 19:46:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 19:46:03,462 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:46:03,462 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 19:46:03,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-20 19:46:03,463 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:46:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:46:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 158128509, now seen corresponding path program 1 times
[2022-02-20 19:46:03,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:46:03,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350968441]
[2022-02-20 19:46:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:46:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:46:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:46:03,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {24178#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {24178#true} is VALID
[2022-02-20 19:46:03,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {24178#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {24178#true} is VALID
[2022-02-20 19:46:03,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {24178#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {24178#true} is VALID
[2022-02-20 19:46:03,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {24178#true} assume 0 == ~r1~0 % 256; {24178#true} is VALID
[2022-02-20 19:46:03,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {24178#true} assume ~id1~0 >= 0; {24178#true} is VALID
[2022-02-20 19:46:03,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {24178#true} assume 0 == ~st1~0; {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID
[2022-02-20 19:46:03,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID
[2022-02-20 19:46:03,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID
[2022-02-20 19:46:03,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID
[2022-02-20 19:46:03,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {24180#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID
[2022-02-20 19:46:03,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID
[2022-02-20 19:46:03,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID
[2022-02-20 19:46:03,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID
[2022-02-20 19:46:03,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {24181#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {24182#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID
[2022-02-20 19:46:03,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {24183#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode5~0 % 256); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,763 INFO L290 TraceCheckUtils]: 59: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:46:03,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {24184#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);check_~tmp~1#1 := 0; {24179#false} is VALID
[2022-02-20 19:46:03,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {24179#false} check_#res#1 := check_~tmp~1#1; {24179#false} is VALID
[2022-02-20 19:46:03,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {24179#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {24179#false} is VALID
[2022-02-20 19:46:03,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {24179#false} assume 0 == assert_~arg#1 % 256; {24179#false} is VALID
[2022-02-20 19:46:03,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {24179#false} assume !false; {24179#false} is VALID
[2022-02-20 19:46:03,765 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 19:46:03,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:46:03,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350968441]
[2022-02-20 19:46:03,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350968441] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:46:03,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:46:03,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-20 19:46:03,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395288457]
[2022-02-20 19:46:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:46:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:03,767 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:46:03,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:03,825 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 19:46:03,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-20 19:46:03,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:46:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-20 19:46:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2022-02-20 19:46:03,827 INFO L87 Difference]: Start difference. First operand 1159 states and 2045 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:06,190 INFO L93 Difference]: Finished difference Result 1529 states and 2615 transitions.
[2022-02-20 19:46:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 19:46:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:46:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions.
[2022-02-20 19:46:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions.
[2022-02-20 19:46:06,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1729 transitions.
[2022-02-20 19:46:07,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1729 edges. 1729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:46:07,736 INFO L225 Difference]: With dead ends: 1529
[2022-02-20 19:46:07,736 INFO L226 Difference]: Without dead ends: 1161
[2022-02-20 19:46:07,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90
[2022-02-20 19:46:07,737 INFO L933 BasicCegarLoop]: 1568 mSDtfsCounter, 1677 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-20 19:46:07,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1677 Valid, 1978 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-20 19:46:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states.
[2022-02-20 19:46:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159.
[2022-02-20 19:46:07,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:46:07,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1161 states. Second operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:07,908 INFO L74 IsIncluded]: Start isIncluded. First operand 1161 states. Second operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:07,909 INFO L87 Difference]: Start difference. First operand 1161 states. Second operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:07,946 INFO L93 Difference]: Finished difference Result 1161 states and 2042 transitions.
[2022-02-20 19:46:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2042 transitions.
[2022-02-20 19:46:07,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:07,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:07,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 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 1161 states.
[2022-02-20 19:46:07,951 INFO L87 Difference]: Start difference. First operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 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 1161 states.
[2022-02-20 19:46:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:07,995 INFO L93 Difference]: Finished difference Result 1161 states and 2042 transitions.
[2022-02-20 19:46:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2042 transitions.
[2022-02-20 19:46:07,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:07,997 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:46:07,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:46:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 1.7640449438202248) internal successors, (2041), 1158 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2041 transitions.
[2022-02-20 19:46:08,058 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2041 transitions. Word has length 66
[2022-02-20 19:46:08,058 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:46:08,058 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 2041 transitions.
[2022-02-20 19:46:08,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:46:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2041 transitions.
[2022-02-20 19:46:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 19:46:08,060 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:46:08,060 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 19:46:08,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-20 19:46:08,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:46:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:46:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1100417095, now seen corresponding path program 1 times
[2022-02-20 19:46:08,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:46:08,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570876124]
[2022-02-20 19:46:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:46:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:46:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:46:08,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {29401#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {29401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {29401#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {29401#true} assume 0 == ~r1~0 % 256; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {29401#true} assume ~id1~0 >= 0; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {29401#true} assume 0 == ~st1~0; {29401#true} is VALID
[2022-02-20 19:46:08,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {29401#true} assume ~send1~0 == ~id1~0; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {29401#true} assume 0 == ~mode1~0 % 256; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {29401#true} assume ~id2~0 >= 0; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {29401#true} assume 0 == ~st2~0; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {29401#true} assume ~send2~0 == ~id2~0; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {29401#true} assume 0 == ~mode2~0 % 256; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {29401#true} assume ~id3~0 >= 0; {29401#true} is VALID
[2022-02-20 19:46:08,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {29401#true} assume 0 == ~st3~0; {29401#true} is VALID
[2022-02-20 19:46:08,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {29401#true} assume ~send3~0 == ~id3~0; {29401#true} is VALID
[2022-02-20 19:46:08,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {29401#true} assume 0 == ~mode3~0 % 256; {29401#true} is VALID
[2022-02-20 19:46:08,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {29401#true} assume ~id4~0 >= 0; {29401#true} is VALID
[2022-02-20 19:46:08,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {29401#true} assume 0 == ~st4~0; {29401#true} is VALID
[2022-02-20 19:46:08,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {29401#true} assume ~send4~0 == ~id4~0; {29401#true} is VALID
[2022-02-20 19:46:08,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {29401#true} assume 0 == ~mode4~0 % 256; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 19:46:08,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {29403#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29402#false} is VALID
[2022-02-20 19:46:08,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {29402#false} assume node4_~m4~0#1 != ~nomsg~0; {29402#false} is VALID
[2022-02-20 19:46:08,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {29402#false} assume !(node4_~m4~0#1 > ~id4~0); {29402#false} is VALID
[2022-02-20 19:46:08,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {29402#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {29402#false} ~mode4~0 := 0; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {29402#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {29402#false} assume !(0 != ~mode5~0 % 256); {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {29402#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {29402#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {29402#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29402#false} is VALID
[2022-02-20 19:46:08,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {29402#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {29402#false} is VALID
[2022-02-20 19:46:08,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {29402#false} check_#res#1 := check_~tmp~1#1; {29402#false} is VALID
[2022-02-20 19:46:08,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {29402#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29402#false} is VALID
[2022-02-20 19:46:08,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {29402#false} assume 0 == assert_~arg#1 % 256; {29402#false} is VALID
[2022-02-20 19:46:08,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {29402#false} assume !false; {29402#false} is VALID
[2022-02-20 19:46:08,146 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 19:46:08,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:46:08,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570876124]
[2022-02-20 19:46:08,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570876124] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:46:08,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:46:08,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:46:08,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095736240]
[2022-02-20 19:46:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:46:08,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:08,148 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:46:08,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:08,196 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 19:46:08,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:46:08,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:46:08,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:46:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:08,198 INFO L87 Difference]: Start difference. First operand 1159 states and 2041 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:10,227 INFO L93 Difference]: Finished difference Result 1847 states and 3091 transitions.
[2022-02-20 19:46:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:46:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:46:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:46:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:46:10,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions.
[2022-02-20 19:46:11,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:46:11,723 INFO L225 Difference]: With dead ends: 1847
[2022-02-20 19:46:11,723 INFO L226 Difference]: Without dead ends: 1479
[2022-02-20 19:46:11,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:11,725 INFO L933 BasicCegarLoop]: 1591 mSDtfsCounter, 1502 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:46:11,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1686 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:46:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states.
[2022-02-20 19:46:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1477.
[2022-02-20 19:46:12,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:46:12,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1479 states. Second operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:12,052 INFO L74 IsIncluded]: Start isIncluded. First operand 1479 states. Second operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:12,054 INFO L87 Difference]: Start difference. First operand 1479 states. Second operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:12,123 INFO L93 Difference]: Finished difference Result 1479 states and 2518 transitions.
[2022-02-20 19:46:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2518 transitions.
[2022-02-20 19:46:12,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:12,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:12,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 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 1479 states.
[2022-02-20 19:46:12,129 INFO L87 Difference]: Start difference. First operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 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 1479 states.
[2022-02-20 19:46:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:12,214 INFO L93 Difference]: Finished difference Result 1479 states and 2518 transitions.
[2022-02-20 19:46:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2518 transitions.
[2022-02-20 19:46:12,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:12,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:12,216 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:46:12,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:46:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1475 states have (on average 1.7064406779661017) internal successors, (2517), 1476 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2517 transitions.
[2022-02-20 19:46:12,302 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2517 transitions. Word has length 66
[2022-02-20 19:46:12,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:46:12,302 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 2517 transitions.
[2022-02-20 19:46:12,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2517 transitions.
[2022-02-20 19:46:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 19:46:12,303 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:46:12,303 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 19:46:12,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-20 19:46:12,304 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:46:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:46:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -826729383, now seen corresponding path program 1 times
[2022-02-20 19:46:12,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:46:12,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633688643]
[2022-02-20 19:46:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:46:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:46:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:46:12,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {36010#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36010#true} is VALID
[2022-02-20 19:46:12,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {36010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {36010#true} is VALID
[2022-02-20 19:46:12,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {36010#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {36010#true} assume 0 == ~r1~0 % 256; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {36010#true} assume ~id1~0 >= 0; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {36010#true} assume 0 == ~st1~0; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {36010#true} assume ~send1~0 == ~id1~0; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {36010#true} assume 0 == ~mode1~0 % 256; {36010#true} is VALID
[2022-02-20 19:46:12,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {36010#true} assume ~id2~0 >= 0; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {36010#true} assume 0 == ~st2~0; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {36010#true} assume ~send2~0 == ~id2~0; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {36010#true} assume 0 == ~mode2~0 % 256; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {36010#true} assume ~id3~0 >= 0; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {36010#true} assume 0 == ~st3~0; {36010#true} is VALID
[2022-02-20 19:46:12,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {36010#true} assume ~send3~0 == ~id3~0; {36010#true} is VALID
[2022-02-20 19:46:12,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {36010#true} assume 0 == ~mode3~0 % 256; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:46:12,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {36012#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36011#false} is VALID
[2022-02-20 19:46:12,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {36011#false} assume node3_~m3~0#1 != ~nomsg~0; {36011#false} is VALID
[2022-02-20 19:46:12,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {36011#false} assume !(node3_~m3~0#1 > ~id3~0); {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {36011#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {36011#false} ~mode3~0 := 0; {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {36011#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {36011#false} assume !(0 != ~mode4~0 % 256); {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {36011#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {36011#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {36011#false} is VALID
[2022-02-20 19:46:12,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {36011#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {36011#false} assume !(0 != ~mode5~0 % 256); {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {36011#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {36011#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {36011#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {36011#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {36011#false} check_#res#1 := check_~tmp~1#1; {36011#false} is VALID
[2022-02-20 19:46:12,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {36011#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36011#false} is VALID
[2022-02-20 19:46:12,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {36011#false} assume 0 == assert_~arg#1 % 256; {36011#false} is VALID
[2022-02-20 19:46:12,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {36011#false} assume !false; {36011#false} is VALID
[2022-02-20 19:46:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 19:46:12,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:46:12,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633688643]
[2022-02-20 19:46:12,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633688643] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:46:12,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:46:12,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:46:12,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999347290]
[2022-02-20 19:46:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:46:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:12,392 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:46:12,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:12,446 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 19:46:12,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:46:12,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:46:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:46:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:12,448 INFO L87 Difference]: Start difference. First operand 1477 states and 2517 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:14,832 INFO L93 Difference]: Finished difference Result 2753 states and 4439 transitions.
[2022-02-20 19:46:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:46:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:46:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:46:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions.
[2022-02-20 19:46:14,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions.
[2022-02-20 19:46:16,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:46:16,391 INFO L225 Difference]: With dead ends: 2753
[2022-02-20 19:46:16,391 INFO L226 Difference]: Without dead ends: 2067
[2022-02-20 19:46:16,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:16,393 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:46:16,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1506 Valid, 1695 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:46:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states.
[2022-02-20 19:46:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2065.
[2022-02-20 19:46:17,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:46:17,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2067 states. Second operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:17,047 INFO L74 IsIncluded]: Start isIncluded. First operand 2067 states. Second operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:17,050 INFO L87 Difference]: Start difference. First operand 2067 states. Second operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:17,221 INFO L93 Difference]: Finished difference Result 2067 states and 3382 transitions.
[2022-02-20 19:46:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3382 transitions.
[2022-02-20 19:46:17,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:17,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:17,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 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 2067 states.
[2022-02-20 19:46:17,229 INFO L87 Difference]: Start difference. First operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 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 2067 states.
[2022-02-20 19:46:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:46:17,398 INFO L93 Difference]: Finished difference Result 2067 states and 3382 transitions.
[2022-02-20 19:46:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3382 transitions.
[2022-02-20 19:46:17,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:46:17,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:46:17,401 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:46:17,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:46:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 2063 states have (on average 1.6388754241396024) internal successors, (3381), 2064 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:46:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3381 transitions.
[2022-02-20 19:46:17,552 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3381 transitions. Word has length 66
[2022-02-20 19:46:17,552 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:46:17,553 INFO L470 AbstractCegarLoop]: Abstraction has 2065 states and 3381 transitions.
[2022-02-20 19:46:17,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3381 transitions.
[2022-02-20 19:46:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 19:46:17,553 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:46:17,553 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 19:46:17,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-20 19:46:17,554 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:46:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:46:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 992342265, now seen corresponding path program 1 times
[2022-02-20 19:46:17,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:46:17,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390929678]
[2022-02-20 19:46:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:46:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:46:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:46:17,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {45599#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(32, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {45599#true} is VALID
[2022-02-20 19:46:17,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {45599#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {45599#true} is VALID
[2022-02-20 19:46:17,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {45599#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45599#true} is VALID
[2022-02-20 19:46:17,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {45599#true} assume 0 == ~r1~0 % 256; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {45599#true} assume ~id1~0 >= 0; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {45599#true} assume 0 == ~st1~0; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {45599#true} assume ~send1~0 == ~id1~0; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {45599#true} assume 0 == ~mode1~0 % 256; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {45599#true} assume ~id2~0 >= 0; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {45599#true} assume 0 == ~st2~0; {45599#true} is VALID
[2022-02-20 19:46:17,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {45599#true} assume ~send2~0 == ~id2~0; {45599#true} is VALID
[2022-02-20 19:46:17,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {45599#true} assume 0 == ~mode2~0 % 256; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:46:17,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {45601#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {45600#false} assume node2_~m2~0#1 != ~nomsg~0; {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {45600#false} assume !(node2_~m2~0#1 > ~id2~0); {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {45600#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {45600#false} ~mode2~0 := 0; {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {45600#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {45600#false} assume !(0 != ~mode3~0 % 256); {45600#false} is VALID
[2022-02-20 19:46:17,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {45600#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {45600#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {45600#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {45600#false} assume !(0 != ~mode4~0 % 256); {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {45600#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {45600#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {45600#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {45600#false} is VALID
[2022-02-20 19:46:17,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {45600#false} assume !(0 != ~mode5~0 % 256); {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {45600#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {45600#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {45600#false} assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {45600#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {45600#false} check_#res#1 := check_~tmp~1#1; {45600#false} is VALID
[2022-02-20 19:46:17,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {45600#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45600#false} is VALID
[2022-02-20 19:46:17,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {45600#false} assume 0 == assert_~arg#1 % 256; {45600#false} is VALID
[2022-02-20 19:46:17,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {45600#false} assume !false; {45600#false} is VALID
[2022-02-20 19:46:17,620 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 19:46:17,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:46:17,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390929678]
[2022-02-20 19:46:17,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390929678] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:46:17,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:46:17,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:46:17,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292613045]
[2022-02-20 19:46:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:46:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:17,622 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:46:17,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:46:17,667 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 19:46:17,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:46:17,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:46:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:46:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:46:17,668 INFO L87 Difference]: Start difference. First operand 2065 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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)