./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:45:44,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:45:44,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:45:44,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:45:44,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:45:44,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:45:44,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:45:44,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:45:44,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:45:44,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:45:44,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:45:44,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:45:44,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:45:44,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:45:44,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:45:44,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:45:44,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:45:44,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:45:44,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:45:44,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:45:44,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:45:44,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:45:44,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:45:44,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:45:44,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:45:44,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:45:44,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:45:44,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:45:44,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:45:44,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:45:44,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:45:44,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:45:44,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:45:44,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:45:44,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:45:44,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:45:44,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:45:44,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:45:44,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:45:44,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:45:44,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:45:44,204 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:44,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:45:44,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:45:44,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:45:44,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:45:44,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:45:44,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:45:44,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:45:44,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:45:44,229 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:45:44,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:45:44,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:45:44,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:45:44,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:45:44,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:45:44,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:45:44,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:45:44,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:45:44,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:45:44,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:44,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:45:44,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:45:44,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:45:44,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:45:44,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:45:44,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:45:44,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:45:44,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:45:44,233 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 -> 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb [2022-02-20 19:45:44,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:45:44,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:45:44,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:45:44,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:45:44,466 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:45:44,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:45:44,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b093e60ac/d2b973132c314166bcb233e6194d5227/FLAG9875fcc58 [2022-02-20 19:45:45,055 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:45:45,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:45:45,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b093e60ac/d2b973132c314166bcb233e6194d5227/FLAG9875fcc58 [2022-02-20 19:45:45,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b093e60ac/d2b973132c314166bcb233e6194d5227 [2022-02-20 19:45:45,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:45:45,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:45:45,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:45,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:45:45,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:45:45,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:45" (1/1) ... [2022-02-20 19:45:45,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e69665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:45, skipping insertion in model container [2022-02-20 19:45:45,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:45" (1/1) ... [2022-02-20 19:45:45,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:45:45,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:45:45,691 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[11742,11755] [2022-02-20 19:45:45,746 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[18678,18691] [2022-02-20 19:45:46,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:46,381 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:45:46,418 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[11742,11755] [2022-02-20 19:45:46,426 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[18678,18691] [2022-02-20 19:45:46,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:46,754 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:45:46,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:46 WrapperNode [2022-02-20 19:45:46,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:46,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:46,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:45:46,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:45:46,762 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:46" (1/1) ... [2022-02-20 19:45:46,794 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:46" (1/1) ... [2022-02-20 19:45:47,165 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5086 [2022-02-20 19:45:47,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:47,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:45:47,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:45:47,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:45:47,184 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:46" (1/1) ... [2022-02-20 19:45:47,206 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:46" (1/1) ... [2022-02-20 19:45:47,301 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:46" (1/1) ... [2022-02-20 19:45:47,302 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:46" (1/1) ... [2022-02-20 19:45:47,517 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:46" (1/1) ... [2022-02-20 19:45:47,532 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:46" (1/1) ... [2022-02-20 19:45:47,550 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:46" (1/1) ... [2022-02-20 19:45:47,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:45:47,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:45:47,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:45:47,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:45:47,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:46" (1/1) ... [2022-02-20 19:45:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:45:47,607 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:47,622 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:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:45:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:45:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:45:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:45:47,703 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:45:47,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:45:54,054 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:45:54,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:45:54,064 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:45:54,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:54 BoogieIcfgContainer [2022-02-20 19:45:54,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:45:54,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:45:54,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:45:54,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:45:54,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:45:45" (1/3) ... [2022-02-20 19:45:54,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103836ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:54, skipping insertion in model container [2022-02-20 19:45:54,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:46" (2/3) ... [2022-02-20 19:45:54,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103836ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:54, skipping insertion in model container [2022-02-20 19:45:54,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:54" (3/3) ... [2022-02-20 19:45:54,072 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:45:54,075 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:45:54,075 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:45:54,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:45:54,112 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:54,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:45:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have 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:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:54,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:54,147 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:54,147 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:45:54,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:54,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140124085] [2022-02-20 19:45:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:54,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(41, 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; {912#true} is VALID [2022-02-20 19:45:54,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#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; {912#true} is VALID [2022-02-20 19:45:54,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#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; {912#true} is VALID [2022-02-20 19:45:54,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:45:54,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:45:54,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#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; {912#true} is VALID [2022-02-20 19:45:54,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {913#false} is VALID [2022-02-20 19:45:54,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:54,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:45:54,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:54,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:54,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:45:54,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:54,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:54,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:45:54,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:54,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:54,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:45:54,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {913#false} is VALID [2022-02-20 19:45:54,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:45:54,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:54,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:45:54,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:45:54,313 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:54,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:54,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140124085] [2022-02-20 19:45:54,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140124085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:54,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:54,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:45:54,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496723606] [2022-02-20 19:45:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:54,320 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:54,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:54,323 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:54,357 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:54,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:45:54,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:54,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:45:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:45:54,375 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 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:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:55,670 INFO L93 Difference]: Finished difference Result 1779 states and 3372 transitions. [2022-02-20 19:45:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:45:55,670 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:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:55,671 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:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:55,696 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:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:55,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3372 transitions. [2022-02-20 19:45:58,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3372 edges. 3372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:58,417 INFO L225 Difference]: With dead ends: 1779 [2022-02-20 19:45:58,418 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:45:58,425 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:58,427 INFO L933 BasicCegarLoop]: 1653 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, 1653 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:58,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1653 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:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:45:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:45:58,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:58,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:58,491 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:58,492 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:58,524 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:45:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:58,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:58,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:58,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:58,539 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:58,609 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:45:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:58,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:58,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:58,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:58,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:45:58,689 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:45:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:58,690 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:45:58,690 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:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:58,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:58,692 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:58,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:45:58,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:45:58,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:58,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736040079] [2022-02-20 19:45:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:58,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {5268#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(41, 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; {5268#true} is VALID [2022-02-20 19:45:58,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {5268#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; {5268#true} is VALID [2022-02-20 19:45:58,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {5268#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; {5268#true} is VALID [2022-02-20 19:45:58,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {5268#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:45:58,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5271#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:45:58,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#(= |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; {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:45:58,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5269#false} is VALID [2022-02-20 19:45:58,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {5269#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:58,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {5269#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:58,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {5269#false} ~mode1~0 := 0; {5269#false} is VALID [2022-02-20 19:45:58,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {5269#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:58,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {5269#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:58,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {5269#false} ~mode2~0 := 0; {5269#false} is VALID [2022-02-20 19:45:58,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {5269#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:58,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {5269#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:58,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {5269#false} ~mode3~0 := 0; {5269#false} is VALID [2022-02-20 19:45:58,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {5269#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:58,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {5269#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:58,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {5269#false} ~mode4~0 := 0; {5269#false} is VALID [2022-02-20 19:45:58,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {5269#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:58,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {5269#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:58,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {5269#false} ~mode5~0 := 0; {5269#false} is VALID [2022-02-20 19:45:58,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {5269#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5269#false} is VALID [2022-02-20 19:45:58,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {5269#false} check_#res#1 := check_~tmp~1#1; {5269#false} is VALID [2022-02-20 19:45:58,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:58,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {5269#false} assume 0 == assert_~arg#1 % 256; {5269#false} is VALID [2022-02-20 19:45:58,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {5269#false} assume !false; {5269#false} is VALID [2022-02-20 19:45:58,843 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:58,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:58,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736040079] [2022-02-20 19:45:58,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736040079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:58,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:58,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:45:58,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461025743] [2022-02-20 19:45:58,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:58,845 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:58,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:58,845 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:58,905 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:58,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:45:58,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:45:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:45:58,907 INFO L87 Difference]: Start difference. First operand 843 states and 1589 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:46:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:02,991 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:46:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:46:02,992 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:46:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:02,992 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:46:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:46:03,001 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:46:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:46:03,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:46:04,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:04,367 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:46:04,368 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:46:04,371 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:46:04,373 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 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:46:04,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:46:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:46:04,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:04,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:04,396 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:04,397 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:04,424 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:46:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:04,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:04,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:04,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:04,430 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:04,458 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:46:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:04,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:04,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:04,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:04,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:46:04,489 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:46:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:04,489 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:46:04,489 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:46:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 19:46:04,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:04,491 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] [2022-02-20 19:46:04,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:46:04,491 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2075627621, now seen corresponding path program 1 times [2022-02-20 19:46:04,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:04,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869739573] [2022-02-20 19:46:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:04,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#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(41, 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; {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} 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; {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet47#1);havoc main_#t~nondet47#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet45#1, main2_#t~ret46#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet45#1 && main2_#t~nondet45#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet45#1;havoc main2_#t~nondet45#1; {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret42#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:46:04,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {8746#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8747#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:46:04,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {8747#(not (= (+ ~a7~0 (- 12)) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8745#false} is VALID [2022-02-20 19:46:04,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 19:46:04,728 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:04,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:04,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869739573] [2022-02-20 19:46:04,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869739573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:04,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:04,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:04,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746096047] [2022-02-20 19:46:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:46:04,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:04,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:04,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:04,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:46:04,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:46:04,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:46:04,780 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:16,946 INFO L93 Difference]: Finished difference Result 3098 states and 5867 transitions. [2022-02-20 19:46:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:46:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:46:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:46:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:46:16,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5867 transitions. [2022-02-20 19:46:21,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5867 edges. 5867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:21,847 INFO L225 Difference]: With dead ends: 3098 [2022-02-20 19:46:21,847 INFO L226 Difference]: Without dead ends: 2345 [2022-02-20 19:46:21,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:46:21,849 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 2419 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2419 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:46:21,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2419 Valid, 830 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-20 19:46:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-02-20 19:46:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2022-02-20 19:46:21,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:21,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have 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:21,939 INFO L74 IsIncluded]: Start isIncluded. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have 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:21,942 INFO L87 Difference]: Start difference. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have 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:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:22,240 INFO L93 Difference]: Finished difference Result 2345 states and 3684 transitions. [2022-02-20 19:46:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3684 transitions. [2022-02-20 19:46:22,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:22,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:22,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 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 2345 states. [2022-02-20 19:46:22,261 INFO L87 Difference]: Start difference. First operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 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 2345 states. [2022-02-20 19:46:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:22,416 INFO L93 Difference]: Finished difference Result 2345 states and 3684 transitions. [2022-02-20 19:46:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3684 transitions. [2022-02-20 19:46:22,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:22,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:22,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:22,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2343 states have (on average 1.5723431498079385) internal successors, (3684), 2344 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have 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:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3684 transitions. [2022-02-20 19:46:22,589 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3684 transitions. Word has length 60 [2022-02-20 19:46:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:22,589 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 3684 transitions. [2022-02-20 19:46:22,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3684 transitions. [2022-02-20 19:46:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:22,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:22,591 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:46:22,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:46:22,591 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:46:22,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:22,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176115248] [2022-02-20 19:46:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:22,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {18938#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(41, 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; {18938#true} is VALID [2022-02-20 19:46:22,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {18938#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; {18938#true} is VALID [2022-02-20 19:46:22,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {18938#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; {18938#true} is VALID [2022-02-20 19:46:22,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {18938#true} assume 0 == ~r1~0 % 256; {18938#true} is VALID [2022-02-20 19:46:22,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {18938#true} assume ~id1~0 >= 0; {18938#true} is VALID [2022-02-20 19:46:22,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {18938#true} assume 0 == ~st1~0; {18938#true} is VALID [2022-02-20 19:46:22,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {18938#true} assume ~send1~0 == ~id1~0; {18938#true} is VALID [2022-02-20 19:46:22,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {18938#true} assume 0 == ~mode1~0 % 256; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:22,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {18940#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18939#false} is VALID [2022-02-20 19:46:22,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {18939#false} assume !(node1_~m1~0#1 != ~nomsg~0); {18939#false} is VALID [2022-02-20 19:46:22,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {18939#false} ~mode1~0 := 0; {18939#false} is VALID [2022-02-20 19:46:22,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {18939#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18939#false} is VALID [2022-02-20 19:46:22,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {18939#false} assume !(node2_~m2~0#1 != ~nomsg~0); {18939#false} is VALID [2022-02-20 19:46:22,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {18939#false} ~mode2~0 := 0; {18939#false} is VALID [2022-02-20 19:46:22,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {18939#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18939#false} is VALID [2022-02-20 19:46:22,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {18939#false} assume !(node3_~m3~0#1 != ~nomsg~0); {18939#false} is VALID [2022-02-20 19:46:22,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {18939#false} ~mode3~0 := 0; {18939#false} is VALID [2022-02-20 19:46:22,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {18939#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18939#false} is VALID [2022-02-20 19:46:22,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {18939#false} assume !(node4_~m4~0#1 != ~nomsg~0); {18939#false} is VALID [2022-02-20 19:46:22,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {18939#false} ~mode4~0 := 0; {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {18939#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {18939#false} assume !(node5_~m5~0#1 != ~nomsg~0); {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {18939#false} ~mode5~0 := 0; {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {18939#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {18939#false} is VALID [2022-02-20 19:46:22,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {18939#false} check_#res#1 := check_~tmp~1#1; {18939#false} is VALID [2022-02-20 19:46:22,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {18939#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; {18939#false} is VALID [2022-02-20 19:46:22,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {18939#false} assume 0 == assert_~arg#1 % 256; {18939#false} is VALID [2022-02-20 19:46:22,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {18939#false} assume !false; {18939#false} is VALID [2022-02-20 19:46:22,690 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:22,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:22,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176115248] [2022-02-20 19:46:22,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176115248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:22,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:22,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:22,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047589997] [2022-02-20 19:46:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:22,692 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:46:22,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:22,692 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:46:22,756 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:46:22,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:22,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:22,758 INFO L87 Difference]: Start difference. First operand 2345 states and 3684 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:46:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:24,605 INFO L93 Difference]: Finished difference Result 2443 states and 3838 transitions. [2022-02-20 19:46:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:24,606 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:46:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:24,606 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:46:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:24,613 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:46:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:24,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:26,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:26,206 INFO L225 Difference]: With dead ends: 2443 [2022-02-20 19:46:26,206 INFO L226 Difference]: Without dead ends: 2391 [2022-02-20 19:46:26,207 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:26,218 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 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:26,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 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:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-02-20 19:46:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2389. [2022-02-20 19:46:26,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:26,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have 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:26,335 INFO L74 IsIncluded]: Start isIncluded. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have 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:26,339 INFO L87 Difference]: Start difference. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have 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:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:26,621 INFO L93 Difference]: Finished difference Result 2391 states and 3755 transitions. [2022-02-20 19:46:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3755 transitions. [2022-02-20 19:46:26,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:26,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:26,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 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 2391 states. [2022-02-20 19:46:26,631 INFO L87 Difference]: Start difference. First operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 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 2391 states. [2022-02-20 19:46:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:26,789 INFO L93 Difference]: Finished difference Result 2391 states and 3755 transitions. [2022-02-20 19:46:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3755 transitions. [2022-02-20 19:46:26,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:26,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:26,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:26,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2387 states have (on average 1.5726853791369921) internal successors, (3754), 2388 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have 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:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3754 transitions. [2022-02-20 19:46:26,972 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3754 transitions. Word has length 64 [2022-02-20 19:46:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:26,973 INFO L470 AbstractCegarLoop]: Abstraction has 2389 states and 3754 transitions. [2022-02-20 19:46:26,973 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:46:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3754 transitions. [2022-02-20 19:46:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:26,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:26,975 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:46:26,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:46:26,975 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:46:26,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:26,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982282294] [2022-02-20 19:46:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:27,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {28629#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(41, 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; {28629#true} is VALID [2022-02-20 19:46:27,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {28629#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; {28629#true} is VALID [2022-02-20 19:46:27,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {28629#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; {28629#true} is VALID [2022-02-20 19:46:27,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {28629#true} assume 0 == ~r1~0 % 256; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {28629#true} assume ~id1~0 >= 0; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {28629#true} assume 0 == ~st1~0; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {28629#true} assume ~send1~0 == ~id1~0; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {28629#true} assume 0 == ~mode1~0 % 256; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {28629#true} assume ~id2~0 >= 0; {28629#true} is VALID [2022-02-20 19:46:27,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {28629#true} assume 0 == ~st2~0; {28629#true} is VALID [2022-02-20 19:46:27,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {28629#true} assume ~send2~0 == ~id2~0; {28629#true} is VALID [2022-02-20 19:46:27,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {28629#true} assume 0 == ~mode2~0 % 256; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(= (+ (* (- 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; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {28631#(= (+ (* (- 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; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {28631#(= (+ (* (- 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; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {28631#(= (+ (* (- 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; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {28631#(= (+ (* (- 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; {28631#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:27,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {28631#(= (+ (* (- 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; {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {28630#false} assume !(node2_~m2~0#1 != ~nomsg~0); {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {28630#false} ~mode2~0 := 0; {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {28630#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {28630#false} assume !(node3_~m3~0#1 != ~nomsg~0); {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {28630#false} ~mode3~0 := 0; {28630#false} is VALID [2022-02-20 19:46:27,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {28630#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {28630#false} assume !(node4_~m4~0#1 != ~nomsg~0); {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {28630#false} ~mode4~0 := 0; {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {28630#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {28630#false} assume !(node5_~m5~0#1 != ~nomsg~0); {28630#false} is VALID [2022-02-20 19:46:27,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {28630#false} ~mode5~0 := 0; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 59: Hoare triple {28630#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 60: Hoare triple {28630#false} check_#res#1 := check_~tmp~1#1; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 61: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {28630#false} assume 0 == assert_~arg#1 % 256; {28630#false} is VALID [2022-02-20 19:46:27,082 INFO L290 TraceCheckUtils]: 63: Hoare triple {28630#false} assume !false; {28630#false} is VALID [2022-02-20 19:46:27,083 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:27,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:27,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982282294] [2022-02-20 19:46:27,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982282294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:27,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:27,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:27,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82037015] [2022-02-20 19:46:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:27,084 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:46:27,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:27,084 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:46:27,127 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:46:27,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:27,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:27,128 INFO L87 Difference]: Start difference. First operand 2389 states and 3754 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:46:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:29,009 INFO L93 Difference]: Finished difference Result 2569 states and 4038 transitions. [2022-02-20 19:46:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:29,009 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:46:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:29,009 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:46:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:29,015 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:46:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:29,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:30,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:30,649 INFO L225 Difference]: With dead ends: 2569 [2022-02-20 19:46:30,649 INFO L226 Difference]: Without dead ends: 2473 [2022-02-20 19:46:30,650 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:30,651 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 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:30,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 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:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-02-20 19:46:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2471. [2022-02-20 19:46:30,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:30,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have 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:30,728 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have 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:30,730 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have 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:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:30,894 INFO L93 Difference]: Finished difference Result 2473 states and 3884 transitions. [2022-02-20 19:46:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3884 transitions. [2022-02-20 19:46:30,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:30,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:30,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:46:30,902 INFO L87 Difference]: Start difference. First operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:46:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:31,072 INFO L93 Difference]: Finished difference Result 2473 states and 3884 transitions. [2022-02-20 19:46:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3884 transitions. [2022-02-20 19:46:31,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:31,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:31,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:31,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2469 states have (on average 1.5727014985824221) internal successors, (3883), 2470 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have 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:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3883 transitions. [2022-02-20 19:46:31,255 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3883 transitions. Word has length 64 [2022-02-20 19:46:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:31,255 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3883 transitions. [2022-02-20 19:46:31,256 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:46:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3883 transitions. [2022-02-20 19:46:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:31,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:31,256 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:46:31,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:46:31,257 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:46:31,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:31,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752530662] [2022-02-20 19:46:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:31,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {38732#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(41, 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; {38732#true} is VALID [2022-02-20 19:46:31,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#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; {38732#true} is VALID [2022-02-20 19:46:31,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#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; {38732#true} is VALID [2022-02-20 19:46:31,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {38732#true} assume 0 == ~r1~0 % 256; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {38732#true} assume ~id1~0 >= 0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {38732#true} assume 0 == ~st1~0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {38732#true} assume ~send1~0 == ~id1~0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {38732#true} assume 0 == ~mode1~0 % 256; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {38732#true} assume ~id2~0 >= 0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {38732#true} assume 0 == ~st2~0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {38732#true} assume ~send2~0 == ~id2~0; {38732#true} is VALID [2022-02-20 19:46:31,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {38732#true} assume 0 == ~mode2~0 % 256; {38732#true} is VALID [2022-02-20 19:46:31,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {38732#true} assume ~id3~0 >= 0; {38732#true} is VALID [2022-02-20 19:46:31,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {38732#true} assume 0 == ~st3~0; {38732#true} is VALID [2022-02-20 19:46:31,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {38732#true} assume ~send3~0 == ~id3~0; {38732#true} is VALID [2022-02-20 19:46:31,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {38732#true} assume 0 == ~mode3~0 % 256; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {38734#(= (+ (* (- 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; {38734#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:31,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {38734#(= (+ (* (- 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; {38733#false} is VALID [2022-02-20 19:46:31,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {38733#false} assume !(node3_~m3~0#1 != ~nomsg~0); {38733#false} is VALID [2022-02-20 19:46:31,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {38733#false} ~mode3~0 := 0; {38733#false} is VALID [2022-02-20 19:46:31,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 19:46:31,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {38733#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38733#false} is VALID [2022-02-20 19:46:31,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {38733#false} assume !(node4_~m4~0#1 != ~nomsg~0); {38733#false} is VALID [2022-02-20 19:46:31,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {38733#false} ~mode4~0 := 0; {38733#false} is VALID [2022-02-20 19:46:31,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {38733#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {38733#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {38733#false} ~mode5~0 := 0; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {38733#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {38733#false} check_#res#1 := check_~tmp~1#1; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 19:46:31,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {38733#false} assume 0 == assert_~arg#1 % 256; {38733#false} is VALID [2022-02-20 19:46:31,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {38733#false} assume !false; {38733#false} is VALID [2022-02-20 19:46:31,350 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:31,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:31,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752530662] [2022-02-20 19:46:31,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752530662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:31,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:31,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:31,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033557176] [2022-02-20 19:46:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:31,352 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:46:31,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:31,353 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:46:31,407 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:46:31,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:31,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:31,410 INFO L87 Difference]: Start difference. First operand 2471 states and 3883 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:46:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:33,262 INFO L93 Difference]: Finished difference Result 2803 states and 4405 transitions. [2022-02-20 19:46:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:33,262 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:46:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:33,263 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:46:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:33,269 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:46:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:33,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:34,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:34,835 INFO L225 Difference]: With dead ends: 2803 [2022-02-20 19:46:34,836 INFO L226 Difference]: Without dead ends: 2625 [2022-02-20 19:46:34,837 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:34,837 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:34,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 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:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-02-20 19:46:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2623. [2022-02-20 19:46:34,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:34,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states have 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:34,929 INFO L74 IsIncluded]: Start isIncluded. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states have 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:34,931 INFO L87 Difference]: Start difference. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states have 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:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:35,127 INFO L93 Difference]: Finished difference Result 2625 states and 4120 transitions. [2022-02-20 19:46:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 4120 transitions. [2022-02-20 19:46:35,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:35,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:35,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 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 2625 states. [2022-02-20 19:46:35,134 INFO L87 Difference]: Start difference. First operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 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 2625 states. [2022-02-20 19:46:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:35,339 INFO L93 Difference]: Finished difference Result 2625 states and 4120 transitions. [2022-02-20 19:46:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 4120 transitions. [2022-02-20 19:46:35,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:35,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:35,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:35,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2621 states have (on average 1.5715375810759251) internal successors, (4119), 2622 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states have 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:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4119 transitions. [2022-02-20 19:46:35,578 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4119 transitions. Word has length 64 [2022-02-20 19:46:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:35,579 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 4119 transitions. [2022-02-20 19:46:35,579 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:46:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4119 transitions. [2022-02-20 19:46:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:35,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:35,579 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:46:35,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:46:35,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:46:35,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:35,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627293920] [2022-02-20 19:46:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:35,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {49605#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(41, 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; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {49605#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; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {49605#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; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {49605#true} assume 0 == ~r1~0 % 256; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {49605#true} assume ~id1~0 >= 0; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {49605#true} assume 0 == ~st1~0; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {49605#true} assume ~send1~0 == ~id1~0; {49605#true} is VALID [2022-02-20 19:46:35,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {49605#true} assume 0 == ~mode1~0 % 256; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {49605#true} assume ~id2~0 >= 0; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {49605#true} assume 0 == ~st2~0; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {49605#true} assume ~send2~0 == ~id2~0; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {49605#true} assume 0 == ~mode2~0 % 256; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {49605#true} assume ~id3~0 >= 0; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {49605#true} assume 0 == ~st3~0; {49605#true} is VALID [2022-02-20 19:46:35,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {49605#true} assume ~send3~0 == ~id3~0; {49605#true} is VALID [2022-02-20 19:46:35,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {49605#true} assume 0 == ~mode3~0 % 256; {49605#true} is VALID [2022-02-20 19:46:35,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {49605#true} assume ~id4~0 >= 0; {49605#true} is VALID [2022-02-20 19:46:35,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {49605#true} assume 0 == ~st4~0; {49605#true} is VALID [2022-02-20 19:46:35,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {49605#true} assume ~send4~0 == ~id4~0; {49605#true} is VALID [2022-02-20 19:46:35,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {49605#true} assume 0 == ~mode4~0 % 256; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {49607#(= (+ (* (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; {49607#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {49607#(= (+ (* (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; {49606#false} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {49606#false} assume !(node4_~m4~0#1 != ~nomsg~0); {49606#false} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {49606#false} ~mode4~0 := 0; {49606#false} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {49606#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; {49606#false} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {49606#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49606#false} is VALID [2022-02-20 19:46:35,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {49606#false} assume !(node5_~m5~0#1 != ~nomsg~0); {49606#false} is VALID [2022-02-20 19:46:35,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {49606#false} ~mode5~0 := 0; {49606#false} is VALID [2022-02-20 19:46:35,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {49606#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; {49606#false} is VALID [2022-02-20 19:46:35,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {49606#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {49606#false} is VALID [2022-02-20 19:46:35,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {49606#false} check_#res#1 := check_~tmp~1#1; {49606#false} is VALID [2022-02-20 19:46:35,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {49606#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; {49606#false} is VALID [2022-02-20 19:46:35,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {49606#false} assume 0 == assert_~arg#1 % 256; {49606#false} is VALID [2022-02-20 19:46:35,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {49606#false} assume !false; {49606#false} is VALID [2022-02-20 19:46:35,649 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:35,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:35,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627293920] [2022-02-20 19:46:35,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627293920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:35,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:35,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:35,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552965141] [2022-02-20 19:46:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:35,650 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:46:35,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:35,650 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:46:35,685 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:46:35,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:35,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:35,686 INFO L87 Difference]: Start difference. First operand 2623 states and 4119 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:46:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:37,709 INFO L93 Difference]: Finished difference Result 3235 states and 5073 transitions. [2022-02-20 19:46:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:37,710 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:46:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:37,710 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:46:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:37,715 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:46:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:37,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:39,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:39,314 INFO L225 Difference]: With dead ends: 3235 [2022-02-20 19:46:39,314 INFO L226 Difference]: Without dead ends: 2905 [2022-02-20 19:46:39,329 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:39,344 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 1499 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1703 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:39,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1703 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:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2022-02-20 19:46:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2903. [2022-02-20 19:46:39,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:39,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have 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:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have 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:39,545 INFO L87 Difference]: Start difference. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have 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:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:39,789 INFO L93 Difference]: Finished difference Result 2905 states and 4548 transitions. [2022-02-20 19:46:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4548 transitions. [2022-02-20 19:46:39,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:39,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:39,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 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 2905 states. [2022-02-20 19:46:39,797 INFO L87 Difference]: Start difference. First operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 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 2905 states. [2022-02-20 19:46:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:40,044 INFO L93 Difference]: Finished difference Result 2905 states and 4548 transitions. [2022-02-20 19:46:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4548 transitions. [2022-02-20 19:46:40,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:40,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:40,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:40,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2901 states have (on average 1.567390554981041) internal successors, (4547), 2902 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have 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:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4547 transitions. [2022-02-20 19:46:40,318 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4547 transitions. Word has length 64 [2022-02-20 19:46:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:40,319 INFO L470 AbstractCegarLoop]: Abstraction has 2903 states and 4547 transitions. [2022-02-20 19:46:40,319 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:46:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4547 transitions. [2022-02-20 19:46:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:40,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:40,320 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:46:40,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:46:40,320 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:46:40,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:40,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205527370] [2022-02-20 19:46:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:40,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {61910#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(41, 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; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {61910#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; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {61910#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; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {61910#true} assume 0 == ~r1~0 % 256; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {61910#true} assume ~id1~0 >= 0; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {61910#true} assume 0 == ~st1~0; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {61910#true} assume ~send1~0 == ~id1~0; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {61910#true} assume 0 == ~mode1~0 % 256; {61910#true} is VALID [2022-02-20 19:46:40,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {61910#true} assume ~id2~0 >= 0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {61910#true} assume 0 == ~st2~0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {61910#true} assume ~send2~0 == ~id2~0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {61910#true} assume 0 == ~mode2~0 % 256; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {61910#true} assume ~id3~0 >= 0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {61910#true} assume 0 == ~st3~0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {61910#true} assume ~send3~0 == ~id3~0; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {61910#true} assume 0 == ~mode3~0 % 256; {61910#true} is VALID [2022-02-20 19:46:40,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {61910#true} assume ~id4~0 >= 0; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {61910#true} assume 0 == ~st4~0; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {61910#true} assume ~send4~0 == ~id4~0; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {61910#true} assume 0 == ~mode4~0 % 256; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {61910#true} assume ~id5~0 >= 0; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {61910#true} assume 0 == ~st5~0; {61910#true} is VALID [2022-02-20 19:46:40,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {61910#true} assume ~send5~0 == ~id5~0; {61910#true} is VALID [2022-02-20 19:46:40,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {61910#true} assume 0 == ~mode5~0 % 256; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {61912#(= (+ (* (- 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; {61912#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:40,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {61912#(= (+ (* (- 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; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {61911#false} assume !(node5_~m5~0#1 != ~nomsg~0); {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {61911#false} ~mode5~0 := 0; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {61911#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; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {61911#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {61911#false} check_#res#1 := check_~tmp~1#1; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {61911#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; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {61911#false} assume 0 == assert_~arg#1 % 256; {61911#false} is VALID [2022-02-20 19:46:40,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {61911#false} assume !false; {61911#false} is VALID [2022-02-20 19:46:40,409 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:40,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:40,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205527370] [2022-02-20 19:46:40,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205527370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:40,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:40,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:40,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513349506] [2022-02-20 19:46:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:40,410 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:46:40,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:40,410 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:46:40,452 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:46:40,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:40,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:40,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:40,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:40,453 INFO L87 Difference]: Start difference. First operand 2903 states and 4547 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:46:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:42,891 INFO L93 Difference]: Finished difference Result 4027 states and 6277 transitions. [2022-02-20 19:46:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:42,891 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:46:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:42,892 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:46:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:42,897 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:46:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:42,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:44,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:44,496 INFO L225 Difference]: With dead ends: 4027 [2022-02-20 19:46:44,496 INFO L226 Difference]: Without dead ends: 3417 [2022-02-20 19:46:44,498 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:44,500 INFO L933 BasicCegarLoop]: 1606 mSDtfsCounter, 1495 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1702 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:44,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1495 Valid, 1702 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:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2022-02-20 19:46:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3415. [2022-02-20 19:46:44,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:44,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 0 states have 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:44,756 INFO L74 IsIncluded]: Start isIncluded. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 0 states have 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:44,807 INFO L87 Difference]: Start difference. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 0 states have 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:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:45,182 INFO L93 Difference]: Finished difference Result 3417 states and 5316 transitions. [2022-02-20 19:46:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5316 transitions. [2022-02-20 19:46:45,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:45,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:45,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 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 3417 states. [2022-02-20 19:46:45,190 INFO L87 Difference]: Start difference. First operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 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 3417 states. [2022-02-20 19:46:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:45,539 INFO L93 Difference]: Finished difference Result 3417 states and 5316 transitions. [2022-02-20 19:46:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5316 transitions. [2022-02-20 19:46:45,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:45,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:45,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:45,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3413 states have (on average 1.5572809844711397) internal successors, (5315), 3414 states have internal predecessors, (5315), 0 states have call successors, (0), 0 states have 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:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5315 transitions. [2022-02-20 19:46:45,925 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5315 transitions. Word has length 64 [2022-02-20 19:46:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:45,925 INFO L470 AbstractCegarLoop]: Abstraction has 3415 states and 5315 transitions. [2022-02-20 19:46:45,925 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:46:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5315 transitions. [2022-02-20 19:46:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:45,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:45,926 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:46:45,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:46:45,926 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:46:45,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:45,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118829502] [2022-02-20 19:46:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:46,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {76863#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(41, 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; {76863#true} is VALID [2022-02-20 19:46:46,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {76863#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; {76863#true} is VALID [2022-02-20 19:46:46,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {76863#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; {76863#true} is VALID [2022-02-20 19:46:46,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {76863#true} assume 0 == ~r1~0 % 256; {76863#true} is VALID [2022-02-20 19:46:46,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {76863#true} assume ~id1~0 >= 0; {76863#true} is VALID [2022-02-20 19:46:46,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {76863#true} assume 0 == ~st1~0; {76865#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:46,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {76865#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {76865#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:46,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {76865#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {76865#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:46,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {76865#(<= ~st1~0 0)} assume ~id2~0 >= 0; {76865#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:46,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {76865#(<= ~st1~0 0)} assume 0 == ~st2~0; {76866#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {76866#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {76866#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {76866#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {76866#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {76866#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {76866#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {76866#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {76867#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {76868#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {76869#(<= (+ ~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 := ~p3_new~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {76869#(<= (+ ~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 := ~p4_new~0; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {76869#(<= (+ ~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; {76869#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:46,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {76869#(<= (+ ~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; {76864#false} is VALID [2022-02-20 19:46:46,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {76864#false} check_#res#1 := check_~tmp~1#1; {76864#false} is VALID [2022-02-20 19:46:46,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {76864#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; {76864#false} is VALID [2022-02-20 19:46:46,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {76864#false} assume 0 == assert_~arg#1 % 256; {76864#false} is VALID [2022-02-20 19:46:46,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {76864#false} assume !false; {76864#false} is VALID [2022-02-20 19:46:46,032 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:46,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:46,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118829502] [2022-02-20 19:46:46,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118829502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:46,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:46,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:46:46,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885666693] [2022-02-20 19:46:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:46,035 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:46:46,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:46,035 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:46:46,078 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:46:46,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:46:46,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:46:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:46:46,080 INFO L87 Difference]: Start difference. First operand 3415 states and 5315 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)