./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.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 cbac78224547ffded4eea2a5da15a43fb2fd2b6c73f073f7e365339f5e128336 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:07,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:07,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:07,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:07,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:07,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:07,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:07,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:07,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:07,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:07,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:07,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:07,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:07,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:07,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:07,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:07,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:07,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:07,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:07,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:07,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:07,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:07,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:07,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:07,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:07,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:07,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:07,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:07,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:07,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:07,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:07,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:07,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:07,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:07,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:07,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:07,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:07,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:07,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:07,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:07,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:07,312 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:44:07,343 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:07,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:07,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:07,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:07,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:07,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:07,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:07,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:07,346 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:07,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:07,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:07,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:07,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:07,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:07,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:07,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:07,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:07,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:07,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:07,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:07,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:07,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:07,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:07,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:07,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:07,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:07,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:07,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:07,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:07,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:07,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:07,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:07,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:07,352 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 -> cbac78224547ffded4eea2a5da15a43fb2fd2b6c73f073f7e365339f5e128336 [2022-02-20 19:44:07,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:07,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:07,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:07,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:07,641 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:07,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2022-02-20 19:44:07,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e045a812/d5395b228bfb4b5c81e5dbf79ae1d0d6/FLAG2ff9dd172 [2022-02-20 19:44:08,391 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:08,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2022-02-20 19:44:08,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e045a812/d5395b228bfb4b5c81e5dbf79ae1d0d6/FLAG2ff9dd172 [2022-02-20 19:44:08,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e045a812/d5395b228bfb4b5c81e5dbf79ae1d0d6 [2022-02-20 19:44:08,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:08,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:08,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:08,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:08,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:08,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:08" (1/1) ... [2022-02-20 19:44:08,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b759ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:08, skipping insertion in model container [2022-02-20 19:44:08,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:08" (1/1) ... [2022-02-20 19:44:08,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:08,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:09,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[11640,11653] [2022-02-20 19:44:09,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[17195,17208] [2022-02-20 19:44:09,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:09,759 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:09,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[11640,11653] [2022-02-20 19:44:09,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[17195,17208] [2022-02-20 19:44:10,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:10,223 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:10,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10 WrapperNode [2022-02-20 19:44:10,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:10,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:10,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:10,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:10,231 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:44:10" (1/1) ... [2022-02-20 19:44:10,274 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:44:10" (1/1) ... [2022-02-20 19:44:10,745 INFO L137 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5090 [2022-02-20 19:44:10,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:10,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:10,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:10,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:10,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:10,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:10,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:10,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:11,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:11,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:11,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:11,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:11,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:11,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:11,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44:11,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (1/1) ... [2022-02-20 19:44:11,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:11,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:11,160 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:44:11,174 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:44:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:11,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:11,429 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:11,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:44:19,289 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:44:19,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:44:19,306 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:44:19,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:19 BoogieIcfgContainer [2022-02-20 19:44:19,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:44:19,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:44:19,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:44:19,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:44:19,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:08" (1/3) ... [2022-02-20 19:44:19,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ead8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:19, skipping insertion in model container [2022-02-20 19:44:19,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:10" (2/3) ... [2022-02-20 19:44:19,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ead8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:19, skipping insertion in model container [2022-02-20 19:44:19,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:19" (3/3) ... [2022-02-20 19:44:19,319 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2022-02-20 19:44:19,324 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:44:19,325 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:44:19,378 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:44:19,386 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:44:19,387 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:44:19,428 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:44:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:19,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:19,438 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:44:19,438 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:44:19,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:19,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295416957] [2022-02-20 19:44:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:19,723 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(33, 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:44:19,724 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~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {912#true} is VALID [2022-02-20 19:44:19,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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:44:19,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:44:19,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:44:19,726 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:44:19,726 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:44:19,731 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:44:19,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#false} assume !!(main1_~i2~0#1 < 10);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:44:19,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:19,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:44:19,735 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:44:19,735 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:44:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:44:19,736 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:44:19,737 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:44:19,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:19,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:44:19,737 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:44:19,738 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:44:19,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:19,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:44:19,739 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:44:19,740 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:44:19,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:19,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:44:19,740 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:44:19,741 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:44:19,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:44:19,741 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:44:19,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:44:19,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:44:19,743 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:44:19,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:19,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295416957] [2022-02-20 19:44:19,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295416957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:19,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:19,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:19,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380144835] [2022-02-20 19:44:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:19,751 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:44:19,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:19,755 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:44:19,795 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:44:19,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:44:19,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:44:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:44:19,823 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:44:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:21,220 INFO L93 Difference]: Finished difference Result 1781 states and 3374 transitions. [2022-02-20 19:44:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:44:21,220 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:44:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:21,222 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:44:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:21,268 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:44:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:21,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3374 transitions. [2022-02-20 19:44:24,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3374 edges. 3374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:24,096 INFO L225 Difference]: With dead ends: 1781 [2022-02-20 19:44:24,096 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:24,105 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:44:24,110 INFO L933 BasicCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:24,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:24,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:24,215 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:44:24,218 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:44:24,221 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:44:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:24,266 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:24,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:24,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:24,280 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:44:24,283 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:44:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:24,328 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:24,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:24,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:24,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:24,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:24,340 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:44:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:44:24,386 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:44:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:24,386 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:44:24,387 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:44:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:24,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:24,388 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:44:24,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:44:24,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:44:24,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:24,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907830964] [2022-02-20 19:44:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:24,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {5271#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(33, 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; {5271#true} is VALID [2022-02-20 19:44:24,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {5271#true} is VALID [2022-02-20 19:44:24,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {5271#true} is VALID [2022-02-20 19:44:24,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {5271#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:44:24,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5274#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:44:24,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#(= |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; {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:44:24,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5272#false} is VALID [2022-02-20 19:44:24,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#false} assume !!(main1_~i2~0#1 < 10);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; {5272#false} is VALID [2022-02-20 19:44:24,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:24,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {5272#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:24,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {5272#false} ~mode1~0 := 0; {5272#false} is VALID [2022-02-20 19:44:24,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {5272#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:24,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:24,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#false} ~mode2~0 := 0; {5272#false} is VALID [2022-02-20 19:44:24,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {5272#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:24,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {5272#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:24,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {5272#false} ~mode3~0 := 0; {5272#false} is VALID [2022-02-20 19:44:24,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:24,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {5272#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:24,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {5272#false} ~mode4~0 := 0; {5272#false} is VALID [2022-02-20 19:44:24,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {5272#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:24,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {5272#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:24,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {5272#false} ~mode5~0 := 0; {5272#false} is VALID [2022-02-20 19:44:24,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {5272#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5272#false} is VALID [2022-02-20 19:44:24,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {5272#false} check_#res#1 := check_~tmp~1#1; {5272#false} is VALID [2022-02-20 19:44:24,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:24,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {5272#false} assume 0 == assert_~arg#1 % 256; {5272#false} is VALID [2022-02-20 19:44:24,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-02-20 19:44:24,559 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:44:24,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:24,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907830964] [2022-02-20 19:44:24,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907830964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:24,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:24,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:44:24,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259176614] [2022-02-20 19:44:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:24,563 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:44:24,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:24,563 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:44:24,592 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:44:24,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:44:24,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:44:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:44:24,595 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:44:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:28,926 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:44:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:44:28,927 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:44:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:28,927 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:44:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:28,937 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:44:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:28,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:44:30,265 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:44:30,299 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:44:30,299 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:30,300 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:44:30,301 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:44:30,301 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:44:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:30,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:30,323 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:44:30,325 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:44:30,327 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:44:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:30,365 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:30,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:30,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:30,369 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:44:30,372 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:44:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:30,410 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:30,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:30,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:30,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:30,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:30,415 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:44:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:44:30,453 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:44:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:30,454 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:44:30,455 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:44:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:44:30,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:30,458 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] [2022-02-20 19:44:30,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:44:30,459 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 694349877, now seen corresponding path program 1 times [2022-02-20 19:44:30,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:30,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143734072] [2022-02-20 19:44:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:30,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {8747#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(33, 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; {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {8749#(<= ~a7~0 13)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {8749#(<= ~a7~0 13)} assume !(0 != main_#t~nondet48#1);havoc main_#t~nondet48#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet46#1, main2_#t~ret47#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {8749#(<= ~a7~0 13)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet46#1 && main2_#t~nondet46#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet46#1;havoc main2_#t~nondet46#1; {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {8749#(<= ~a7~0 13)} 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~ret43#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {8749#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {8749#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {8749#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(<= ~a7~0 13)} is VALID [2022-02-20 19:44:30,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {8749#(<= ~a7~0 13)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8748#false} is VALID [2022-02-20 19:44:30,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {8748#false} assume !false; {8748#false} is VALID [2022-02-20 19:44:30,583 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:44:30,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:30,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143734072] [2022-02-20 19:44:30,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143734072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:30,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:30,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:30,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464676611] [2022-02-20 19:44:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:44:30,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:30,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:44:30,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:30,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:30,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:30,624 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:44:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:36,583 INFO L93 Difference]: Finished difference Result 2347 states and 4431 transitions. [2022-02-20 19:44:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:44:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:44:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4431 transitions. [2022-02-20 19:44:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:44:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4431 transitions. [2022-02-20 19:44:36,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4431 transitions. [2022-02-20 19:44:40,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4431 edges. 4431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:40,271 INFO L225 Difference]: With dead ends: 2347 [2022-02-20 19:44:40,271 INFO L226 Difference]: Without dead ends: 1594 [2022-02-20 19:44:40,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:44:40,274 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 886 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:40,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 196 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-20 19:44:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2022-02-20 19:44:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2022-02-20 19:44:40,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:40,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:44:40,322 INFO L74 IsIncluded]: Start isIncluded. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:44:40,326 INFO L87 Difference]: Start difference. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:44:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:40,450 INFO L93 Difference]: Finished difference Result 1594 states and 2933 transitions. [2022-02-20 19:44:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:44:40,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:40,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:40,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:40,462 INFO L87 Difference]: Start difference. First operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:40,589 INFO L93 Difference]: Finished difference Result 1594 states and 2933 transitions. [2022-02-20 19:44:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:44:40,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:40,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:40,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:40,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:44:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2933 transitions. [2022-02-20 19:44:40,730 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2933 transitions. Word has length 48 [2022-02-20 19:44:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:40,731 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2933 transitions. [2022-02-20 19:44:40,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:44:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:44:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:40,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:40,733 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:44:40,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:44:40,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:44:40,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:40,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486804779] [2022-02-20 19:44:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:40,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {15924#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(33, 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; {15924#true} is VALID [2022-02-20 19:44:40,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {15924#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {15924#true} is VALID [2022-02-20 19:44:40,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {15924#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {15924#true} is VALID [2022-02-20 19:44:40,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {15924#true} assume 0 == ~r1~0; {15924#true} is VALID [2022-02-20 19:44:40,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {15924#true} assume ~id1~0 >= 0; {15924#true} is VALID [2022-02-20 19:44:40,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {15924#true} assume 0 == ~st1~0; {15924#true} is VALID [2022-02-20 19:44:40,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {15924#true} assume ~send1~0 == ~id1~0; {15924#true} is VALID [2022-02-20 19:44:40,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {15924#true} assume 0 == ~mode1~0 % 256; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {15926#(= (+ (* (- 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; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {15926#(= (+ (* (- 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; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:40,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {15926#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {15925#false} is VALID [2022-02-20 19:44:40,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {15925#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15925#false} is VALID [2022-02-20 19:44:40,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {15925#false} ~mode1~0 := 0; {15925#false} is VALID [2022-02-20 19:44:40,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {15925#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15925#false} is VALID [2022-02-20 19:44:40,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {15925#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15925#false} is VALID [2022-02-20 19:44:40,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {15925#false} ~mode2~0 := 0; {15925#false} is VALID [2022-02-20 19:44:40,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {15925#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15925#false} is VALID [2022-02-20 19:44:40,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {15925#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15925#false} is VALID [2022-02-20 19:44:40,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {15925#false} ~mode3~0 := 0; {15925#false} is VALID [2022-02-20 19:44:40,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {15925#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15925#false} is VALID [2022-02-20 19:44:40,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {15925#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15925#false} is VALID [2022-02-20 19:44:40,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {15925#false} ~mode4~0 := 0; {15925#false} is VALID [2022-02-20 19:44:40,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {15925#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15925#false} is VALID [2022-02-20 19:44:40,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {15925#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15925#false} is VALID [2022-02-20 19:44:40,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {15925#false} ~mode5~0 := 0; {15925#false} is VALID [2022-02-20 19:44:40,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {15925#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {15925#false} is VALID [2022-02-20 19:44:40,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {15925#false} check_#res#1 := check_~tmp~1#1; {15925#false} is VALID [2022-02-20 19:44:40,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {15925#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; {15925#false} is VALID [2022-02-20 19:44:40,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {15925#false} assume 0 == assert_~arg#1 % 256; {15925#false} is VALID [2022-02-20 19:44:40,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {15925#false} assume !false; {15925#false} is VALID [2022-02-20 19:44:40,897 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:44:40,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:40,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486804779] [2022-02-20 19:44:40,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486804779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:40,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:40,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:40,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892197054] [2022-02-20 19:44:40,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:40,899 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:44:40,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:40,900 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:44:40,950 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:44:40,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:40,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:40,952 INFO L87 Difference]: Start difference. First operand 1594 states and 2933 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:44:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:43,010 INFO L93 Difference]: Finished difference Result 1692 states and 3087 transitions. [2022-02-20 19:44:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:43,011 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:44:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:43,011 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:44:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:43,022 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:44:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:43,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:44,493 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:44:44,581 INFO L225 Difference]: With dead ends: 1692 [2022-02-20 19:44:44,581 INFO L226 Difference]: Without dead ends: 1640 [2022-02-20 19:44:44,582 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:44:44,583 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:44:44,584 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:44:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-02-20 19:44:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1638. [2022-02-20 19:44:44,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:44,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:44:44,632 INFO L74 IsIncluded]: Start isIncluded. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:44:44,636 INFO L87 Difference]: Start difference. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:44:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:44,763 INFO L93 Difference]: Finished difference Result 1640 states and 3004 transitions. [2022-02-20 19:44:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3004 transitions. [2022-02-20 19:44:44,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:44,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:44,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:44:44,773 INFO L87 Difference]: Start difference. First operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:44:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:44,901 INFO L93 Difference]: Finished difference Result 1640 states and 3004 transitions. [2022-02-20 19:44:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3004 transitions. [2022-02-20 19:44:44,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:44,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:44,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:44,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:44:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 3003 transitions. [2022-02-20 19:44:45,039 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 3003 transitions. Word has length 64 [2022-02-20 19:44:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:45,040 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 3003 transitions. [2022-02-20 19:44:45,040 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:44:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 3003 transitions. [2022-02-20 19:44:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:45,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:45,042 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:44:45,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:44:45,043 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:44:45,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:45,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112140111] [2022-02-20 19:44:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:45,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {22601#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(33, 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; {22601#true} is VALID [2022-02-20 19:44:45,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {22601#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {22601#true} is VALID [2022-02-20 19:44:45,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {22601#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {22601#true} is VALID [2022-02-20 19:44:45,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {22601#true} assume 0 == ~r1~0; {22601#true} is VALID [2022-02-20 19:44:45,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {22601#true} assume ~id1~0 >= 0; {22601#true} is VALID [2022-02-20 19:44:45,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {22601#true} assume 0 == ~st1~0; {22601#true} is VALID [2022-02-20 19:44:45,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {22601#true} assume ~send1~0 == ~id1~0; {22601#true} is VALID [2022-02-20 19:44:45,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {22601#true} assume 0 == ~mode1~0 % 256; {22601#true} is VALID [2022-02-20 19:44:45,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {22601#true} assume ~id2~0 >= 0; {22601#true} is VALID [2022-02-20 19:44:45,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {22601#true} assume 0 == ~st2~0; {22601#true} is VALID [2022-02-20 19:44:45,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {22601#true} assume ~send2~0 == ~id2~0; {22601#true} is VALID [2022-02-20 19:44:45,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {22601#true} assume 0 == ~mode2~0 % 256; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {22603#(= (+ (* (- 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; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {22603#(= (+ (* (- 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; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {22603#(= (+ (* (- 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; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {22603#(= (+ (* (- 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; {22603#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:45,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {22603#(= (+ (* (- 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; {22602#false} is VALID [2022-02-20 19:44:45,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {22602#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22602#false} is VALID [2022-02-20 19:44:45,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {22602#false} ~mode2~0 := 0; {22602#false} is VALID [2022-02-20 19:44:45,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {22602#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; {22602#false} is VALID [2022-02-20 19:44:45,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {22602#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22602#false} is VALID [2022-02-20 19:44:45,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {22602#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22602#false} is VALID [2022-02-20 19:44:45,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {22602#false} ~mode3~0 := 0; {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {22602#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; {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {22602#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {22602#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {22602#false} ~mode4~0 := 0; {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {22602#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; {22602#false} is VALID [2022-02-20 19:44:45,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {22602#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22602#false} is VALID [2022-02-20 19:44:45,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {22602#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22602#false} is VALID [2022-02-20 19:44:45,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {22602#false} ~mode5~0 := 0; {22602#false} is VALID [2022-02-20 19:44:45,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {22602#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; {22602#false} is VALID [2022-02-20 19:44:45,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {22602#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {22602#false} is VALID [2022-02-20 19:44:45,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {22602#false} check_#res#1 := check_~tmp~1#1; {22602#false} is VALID [2022-02-20 19:44:45,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {22602#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; {22602#false} is VALID [2022-02-20 19:44:45,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {22602#false} assume 0 == assert_~arg#1 % 256; {22602#false} is VALID [2022-02-20 19:44:45,162 INFO L290 TraceCheckUtils]: 63: Hoare triple {22602#false} assume !false; {22602#false} is VALID [2022-02-20 19:44:45,163 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:44:45,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:45,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112140111] [2022-02-20 19:44:45,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112140111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:45,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:45,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:45,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692366943] [2022-02-20 19:44:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:45,165 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:44:45,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:45,166 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:44:45,216 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:44:45,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:45,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:45,217 INFO L87 Difference]: Start difference. First operand 1638 states and 3003 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:44:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:47,039 INFO L93 Difference]: Finished difference Result 1818 states and 3287 transitions. [2022-02-20 19:44:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:47,040 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:44:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:47,040 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:44:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:47,048 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:44:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:47,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:48,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:44:48,574 INFO L225 Difference]: With dead ends: 1818 [2022-02-20 19:44:48,574 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:44:48,575 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:44:48,577 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:44:48,578 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:44:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:44:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:44:48,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:48,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:44:48,639 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:44:48,641 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:44:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:48,766 INFO L93 Difference]: Finished difference Result 1722 states and 3133 transitions. [2022-02-20 19:44:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3133 transitions. [2022-02-20 19:44:48,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:48,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:48,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:44:48,774 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:44:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:48,945 INFO L93 Difference]: Finished difference Result 1722 states and 3133 transitions. [2022-02-20 19:44:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3133 transitions. [2022-02-20 19:44:48,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:48,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:48,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:48,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:44:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 3132 transitions. [2022-02-20 19:44:49,049 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 3132 transitions. Word has length 64 [2022-02-20 19:44:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:49,049 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 3132 transitions. [2022-02-20 19:44:49,049 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:44:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3132 transitions. [2022-02-20 19:44:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:49,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:49,050 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:44:49,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:44:49,051 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:44:49,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:49,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624302751] [2022-02-20 19:44:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:49,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {29690#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(33, 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; {29690#true} is VALID [2022-02-20 19:44:49,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {29690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {29690#true} is VALID [2022-02-20 19:44:49,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {29690#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {29690#true} is VALID [2022-02-20 19:44:49,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {29690#true} assume 0 == ~r1~0; {29690#true} is VALID [2022-02-20 19:44:49,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {29690#true} assume ~id1~0 >= 0; {29690#true} is VALID [2022-02-20 19:44:49,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {29690#true} assume 0 == ~st1~0; {29690#true} is VALID [2022-02-20 19:44:49,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {29690#true} assume ~send1~0 == ~id1~0; {29690#true} is VALID [2022-02-20 19:44:49,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {29690#true} assume 0 == ~mode1~0 % 256; {29690#true} is VALID [2022-02-20 19:44:49,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {29690#true} assume ~id2~0 >= 0; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {29690#true} assume 0 == ~st2~0; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {29690#true} assume ~send2~0 == ~id2~0; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {29690#true} assume 0 == ~mode2~0 % 256; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {29690#true} assume ~id3~0 >= 0; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {29690#true} assume 0 == ~st3~0; {29690#true} is VALID [2022-02-20 19:44:49,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {29690#true} assume ~send3~0 == ~id3~0; {29690#true} is VALID [2022-02-20 19:44:49,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {29690#true} assume 0 == ~mode3~0 % 256; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {29692#(= (+ (* (- 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; {29692#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:49,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {29692#(= (+ (* (- 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; {29691#false} is VALID [2022-02-20 19:44:49,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {29691#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {29691#false} ~mode3~0 := 0; {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {29691#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; {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {29691#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {29691#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {29691#false} ~mode4~0 := 0; {29691#false} is VALID [2022-02-20 19:44:49,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {29691#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; {29691#false} is VALID [2022-02-20 19:44:49,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {29691#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29691#false} is VALID [2022-02-20 19:44:49,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {29691#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29691#false} is VALID [2022-02-20 19:44:49,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {29691#false} ~mode5~0 := 0; {29691#false} is VALID [2022-02-20 19:44:49,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {29691#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; {29691#false} is VALID [2022-02-20 19:44:49,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {29691#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {29691#false} is VALID [2022-02-20 19:44:49,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {29691#false} check_#res#1 := check_~tmp~1#1; {29691#false} is VALID [2022-02-20 19:44:49,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {29691#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; {29691#false} is VALID [2022-02-20 19:44:49,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {29691#false} assume 0 == assert_~arg#1 % 256; {29691#false} is VALID [2022-02-20 19:44:49,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {29691#false} assume !false; {29691#false} is VALID [2022-02-20 19:44:49,129 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:44:49,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:49,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624302751] [2022-02-20 19:44:49,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624302751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:49,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:49,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:49,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290298526] [2022-02-20 19:44:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:49,130 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:44:49,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:49,131 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:44:49,173 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:44:49,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:49,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:49,174 INFO L87 Difference]: Start difference. First operand 1720 states and 3132 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:44:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:50,929 INFO L93 Difference]: Finished difference Result 2052 states and 3654 transitions. [2022-02-20 19:44:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:50,930 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:44:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:50,930 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:44:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:50,935 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:44:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:50,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:52,341 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:44:52,436 INFO L225 Difference]: With dead ends: 2052 [2022-02-20 19:44:52,436 INFO L226 Difference]: Without dead ends: 1874 [2022-02-20 19:44:52,437 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:44:52,438 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:44:52,438 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:44:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-02-20 19:44:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1872. [2022-02-20 19:44:52,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:52,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:44:52,508 INFO L74 IsIncluded]: Start isIncluded. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:44:52,510 INFO L87 Difference]: Start difference. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:44:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:52,637 INFO L93 Difference]: Finished difference Result 1874 states and 3369 transitions. [2022-02-20 19:44:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3369 transitions. [2022-02-20 19:44:52,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:52,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:52,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:44:52,645 INFO L87 Difference]: Start difference. First operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:44:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:52,804 INFO L93 Difference]: Finished difference Result 1874 states and 3369 transitions. [2022-02-20 19:44:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3369 transitions. [2022-02-20 19:44:52,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:52,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:52,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:52,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:44:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3368 transitions. [2022-02-20 19:44:52,941 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3368 transitions. Word has length 64 [2022-02-20 19:44:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:52,942 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 3368 transitions. [2022-02-20 19:44:52,942 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:44:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3368 transitions. [2022-02-20 19:44:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:52,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:52,943 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:44:52,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:44:52,944 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:44:52,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:52,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234570281] [2022-02-20 19:44:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:53,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {37549#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(33, 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; {37549#true} is VALID [2022-02-20 19:44:53,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {37549#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {37549#true} is VALID [2022-02-20 19:44:53,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {37549#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {37549#true} is VALID [2022-02-20 19:44:53,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {37549#true} assume 0 == ~r1~0; {37549#true} is VALID [2022-02-20 19:44:53,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {37549#true} assume ~id1~0 >= 0; {37549#true} is VALID [2022-02-20 19:44:53,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {37549#true} assume 0 == ~st1~0; {37549#true} is VALID [2022-02-20 19:44:53,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {37549#true} assume ~send1~0 == ~id1~0; {37549#true} is VALID [2022-02-20 19:44:53,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {37549#true} assume 0 == ~mode1~0 % 256; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {37549#true} assume ~id2~0 >= 0; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {37549#true} assume 0 == ~st2~0; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {37549#true} assume ~send2~0 == ~id2~0; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {37549#true} assume 0 == ~mode2~0 % 256; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {37549#true} assume ~id3~0 >= 0; {37549#true} is VALID [2022-02-20 19:44:53,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {37549#true} assume 0 == ~st3~0; {37549#true} is VALID [2022-02-20 19:44:53,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {37549#true} assume ~send3~0 == ~id3~0; {37549#true} is VALID [2022-02-20 19:44:53,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {37549#true} assume 0 == ~mode3~0 % 256; {37549#true} is VALID [2022-02-20 19:44:53,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#true} assume ~id4~0 >= 0; {37549#true} is VALID [2022-02-20 19:44:53,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {37549#true} assume 0 == ~st4~0; {37549#true} is VALID [2022-02-20 19:44:53,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {37549#true} assume ~send4~0 == ~id4~0; {37549#true} is VALID [2022-02-20 19:44:53,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {37549#true} assume 0 == ~mode4~0 % 256; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {37551#(= (+ (* (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; {37551#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {37551#(= (+ (* (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; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {37550#false} assume !(node4_~m4~0#1 != ~nomsg~0); {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {37550#false} ~mode4~0 := 0; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {37550#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; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {37550#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {37550#false} assume !(node5_~m5~0#1 != ~nomsg~0); {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {37550#false} ~mode5~0 := 0; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {37550#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; {37550#false} is VALID [2022-02-20 19:44:53,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {37550#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {37550#false} is VALID [2022-02-20 19:44:53,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {37550#false} check_#res#1 := check_~tmp~1#1; {37550#false} is VALID [2022-02-20 19:44:53,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {37550#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; {37550#false} is VALID [2022-02-20 19:44:53,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {37550#false} assume 0 == assert_~arg#1 % 256; {37550#false} is VALID [2022-02-20 19:44:53,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {37550#false} assume !false; {37550#false} is VALID [2022-02-20 19:44:53,023 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:44:53,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:53,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234570281] [2022-02-20 19:44:53,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234570281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:53,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:53,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:53,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742833622] [2022-02-20 19:44:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:53,026 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:44:53,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:53,027 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:44:53,128 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:44:53,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:53,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:53,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:53,129 INFO L87 Difference]: Start difference. First operand 1872 states and 3368 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:44:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:55,014 INFO L93 Difference]: Finished difference Result 2484 states and 4322 transitions. [2022-02-20 19:44:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:55,014 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:44:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:55,014 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:44:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:55,019 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:44:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:55,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:56,439 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:44:56,571 INFO L225 Difference]: With dead ends: 2484 [2022-02-20 19:44:56,572 INFO L226 Difference]: Without dead ends: 2154 [2022-02-20 19:44:56,573 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:44:56,573 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:44:56,574 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:44:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-02-20 19:44:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2152. [2022-02-20 19:44:56,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:56,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:44:56,683 INFO L74 IsIncluded]: Start isIncluded. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:44:56,686 INFO L87 Difference]: Start difference. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:44:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:56,891 INFO L93 Difference]: Finished difference Result 2154 states and 3797 transitions. [2022-02-20 19:44:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3797 transitions. [2022-02-20 19:44:56,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:56,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:56,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:44:56,898 INFO L87 Difference]: Start difference. First operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:44:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:57,031 INFO L93 Difference]: Finished difference Result 2154 states and 3797 transitions. [2022-02-20 19:44:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3797 transitions. [2022-02-20 19:44:57,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:57,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:57,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:57,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:44:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3796 transitions. [2022-02-20 19:44:57,170 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3796 transitions. Word has length 64 [2022-02-20 19:44:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:57,170 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 3796 transitions. [2022-02-20 19:44:57,170 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:44:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3796 transitions. [2022-02-20 19:44:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:57,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:57,171 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:44:57,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:44:57,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:44:57,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:57,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241711410] [2022-02-20 19:44:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:57,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {46840#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(33, 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; {46840#true} is VALID [2022-02-20 19:44:57,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {46840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {46840#true} is VALID [2022-02-20 19:44:57,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {46840#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {46840#true} is VALID [2022-02-20 19:44:57,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {46840#true} assume 0 == ~r1~0; {46840#true} is VALID [2022-02-20 19:44:57,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {46840#true} assume ~id1~0 >= 0; {46840#true} is VALID [2022-02-20 19:44:57,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {46840#true} assume 0 == ~st1~0; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {46840#true} assume ~send1~0 == ~id1~0; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {46840#true} assume 0 == ~mode1~0 % 256; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {46840#true} assume ~id2~0 >= 0; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {46840#true} assume 0 == ~st2~0; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {46840#true} assume ~send2~0 == ~id2~0; {46840#true} is VALID [2022-02-20 19:44:57,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {46840#true} assume 0 == ~mode2~0 % 256; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {46840#true} assume ~id3~0 >= 0; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {46840#true} assume 0 == ~st3~0; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {46840#true} assume ~send3~0 == ~id3~0; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {46840#true} assume 0 == ~mode3~0 % 256; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {46840#true} assume ~id4~0 >= 0; {46840#true} is VALID [2022-02-20 19:44:57,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {46840#true} assume 0 == ~st4~0; {46840#true} is VALID [2022-02-20 19:44:57,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {46840#true} assume ~send4~0 == ~id4~0; {46840#true} is VALID [2022-02-20 19:44:57,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {46840#true} assume 0 == ~mode4~0 % 256; {46840#true} is VALID [2022-02-20 19:44:57,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {46840#true} assume ~id5~0 >= 0; {46840#true} is VALID [2022-02-20 19:44:57,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {46840#true} assume 0 == ~st5~0; {46840#true} is VALID [2022-02-20 19:44:57,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {46840#true} assume ~send5~0 == ~id5~0; {46840#true} is VALID [2022-02-20 19:44:57,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {46840#true} assume 0 == ~mode5~0 % 256; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {46842#(= (+ (* (- 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; {46842#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {46842#(= (+ (* (- 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; {46841#false} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {46841#false} assume !(node5_~m5~0#1 != ~nomsg~0); {46841#false} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {46841#false} ~mode5~0 := 0; {46841#false} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {46841#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; {46841#false} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {46841#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {46841#false} is VALID [2022-02-20 19:44:57,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {46841#false} check_#res#1 := check_~tmp~1#1; {46841#false} is VALID [2022-02-20 19:44:57,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {46841#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; {46841#false} is VALID [2022-02-20 19:44:57,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {46841#false} assume 0 == assert_~arg#1 % 256; {46841#false} is VALID [2022-02-20 19:44:57,291 INFO L290 TraceCheckUtils]: 63: Hoare triple {46841#false} assume !false; {46841#false} is VALID [2022-02-20 19:44:57,291 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:44:57,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:57,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241711410] [2022-02-20 19:44:57,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241711410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:57,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:57,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:57,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659062904] [2022-02-20 19:44:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:57,292 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:44:57,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:57,292 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:44:57,336 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:44:57,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:57,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:57,337 INFO L87 Difference]: Start difference. First operand 2152 states and 3796 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:44:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:59,384 INFO L93 Difference]: Finished difference Result 3276 states and 5526 transitions. [2022-02-20 19:44:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:59,385 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:44:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:59,385 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:44:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:59,390 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:44:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:59,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:00,797 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:45:01,012 INFO L225 Difference]: With dead ends: 3276 [2022-02-20 19:45:01,013 INFO L226 Difference]: Without dead ends: 2666 [2022-02-20 19:45:01,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:01,015 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:45:01,015 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:45:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-02-20 19:45:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2022-02-20 19:45:01,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:01,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:01,236 INFO L74 IsIncluded]: Start isIncluded. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:01,238 INFO L87 Difference]: Start difference. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:01,432 INFO L93 Difference]: Finished difference Result 2666 states and 4565 transitions. [2022-02-20 19:45:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4565 transitions. [2022-02-20 19:45:01,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:01,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:01,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:45:01,441 INFO L87 Difference]: Start difference. First operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:45:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:01,628 INFO L93 Difference]: Finished difference Result 2666 states and 4565 transitions. [2022-02-20 19:45:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4565 transitions. [2022-02-20 19:45:01,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:01,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:01,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:01,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4564 transitions. [2022-02-20 19:45:01,854 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4564 transitions. Word has length 64 [2022-02-20 19:45:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:01,854 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 4564 transitions. [2022-02-20 19:45:01,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4564 transitions. [2022-02-20 19:45:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:01,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:01,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:01,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:45:01,856 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:45:01,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:01,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771361019] [2022-02-20 19:45:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:01,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {58779#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(33, 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; {58779#true} is VALID [2022-02-20 19:45:01,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {58779#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {58779#true} is VALID [2022-02-20 19:45:01,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {58779#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~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; {58779#true} is VALID [2022-02-20 19:45:01,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {58779#true} assume 0 == ~r1~0; {58779#true} is VALID [2022-02-20 19:45:01,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {58779#true} assume ~id1~0 >= 0; {58779#true} is VALID [2022-02-20 19:45:02,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {58779#true} assume 0 == ~st1~0; {58781#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:02,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {58781#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {58781#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:02,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {58781#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {58781#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:02,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {58781#(<= ~st1~0 0)} assume ~id2~0 >= 0; {58781#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:02,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {58781#(<= ~st1~0 0)} assume 0 == ~st2~0; {58782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {58782#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {58782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {58782#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {58782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {58782#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {58782#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {58782#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {58783#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {58784#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {58785#(<= (+ ~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; {58785#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:02,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {58785#(<= (+ ~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; {58780#false} is VALID [2022-02-20 19:45:02,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {58780#false} check_#res#1 := check_~tmp~1#1; {58780#false} is VALID [2022-02-20 19:45:02,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {58780#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; {58780#false} is VALID [2022-02-20 19:45:02,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {58780#false} assume 0 == assert_~arg#1 % 256; {58780#false} is VALID [2022-02-20 19:45:02,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {58780#false} assume !false; {58780#false} is VALID [2022-02-20 19:45:02,020 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:02,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:02,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771361019] [2022-02-20 19:45:02,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771361019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:02,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:02,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:02,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048778390] [2022-02-20 19:45:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:02,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:02,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:02,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:02,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:02,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:02,062 INFO L87 Difference]: Start difference. First operand 2664 states and 4564 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)