./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label06.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.8.ufo.BOUNDED-16.pals+Problem12_label06.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 782b97ab44d54cd800983e700b0d1573a763da7ea88502d61372bfc21545a0f2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:52:31,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:52:31,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:52:31,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:52:31,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:52:31,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:52:31,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:52:31,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:52:31,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:52:31,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:52:31,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:52:31,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:52:31,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:52:31,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:52:31,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:52:31,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:52:31,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:52:31,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:52:31,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:52:31,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:52:31,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:52:31,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:52:31,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:52:31,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:52:31,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:52:31,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:52:31,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:52:31,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:52:31,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:52:31,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:52:31,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:52:31,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:52:31,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:52:31,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:52:31,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:52:31,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:52:31,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:52:31,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:52:31,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:52:31,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:52:31,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:52:31,358 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:52:31,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:52:31,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:52:31,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:52:31,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:52:31,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:52:31,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:52:31,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:52:31,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:52:31,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:52:31,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:52:31,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:31,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:52:31,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:52:31,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:52:31,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:52:31,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:52:31,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:52:31,376 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 -> 782b97ab44d54cd800983e700b0d1573a763da7ea88502d61372bfc21545a0f2 [2022-02-20 19:52:31,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:52:31,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:52:31,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:52:31,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:52:31,537 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:52:31,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label06.c [2022-02-20 19:52:31,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ef9f2e/8671b27f15ac4874aacddce8288ab876/FLAGf14dbf272 [2022-02-20 19:52:32,199 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:52:32,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label06.c [2022-02-20 19:52:32,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ef9f2e/8671b27f15ac4874aacddce8288ab876/FLAGf14dbf272 [2022-02-20 19:52:32,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ef9f2e/8671b27f15ac4874aacddce8288ab876 [2022-02-20 19:52:32,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:52:32,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:52:32,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:32,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:52:32,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:52:32,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:32,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a9d8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32, skipping insertion in model container [2022-02-20 19:52:32,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:32,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:52:32,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:52:33,016 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.8.ufo.BOUNDED-16.pals+Problem12_label06.c[26860,26873] [2022-02-20 19:52:33,063 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.8.ufo.BOUNDED-16.pals+Problem12_label06.c[29677,29690] [2022-02-20 19:52:33,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:33,700 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:52:33,740 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.8.ufo.BOUNDED-16.pals+Problem12_label06.c[26860,26873] [2022-02-20 19:52:33,749 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.8.ufo.BOUNDED-16.pals+Problem12_label06.c[29677,29690] [2022-02-20 19:52:34,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:34,081 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:52:34,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34 WrapperNode [2022-02-20 19:52:34,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:34,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:34,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:52:34,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:52:34,086 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:52:34" (1/1) ... [2022-02-20 19:52:34,124 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:52:34" (1/1) ... [2022-02-20 19:52:34,436 INFO L137 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5281 [2022-02-20 19:52:34,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:34,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:52:34,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:52:34,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:52:34,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:52:34,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:52:34,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:52:34,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:52:34,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (1/1) ... [2022-02-20 19:52:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:52:34,960 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:52:34,964 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:52:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:52:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:52:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:52:34,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:52:35,150 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:52:35,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:52:42,142 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:52:42,152 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:52:42,153 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:52:42,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:42 BoogieIcfgContainer [2022-02-20 19:52:42,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:52:42,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:52:42,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:52:42,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:52:42,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:52:32" (1/3) ... [2022-02-20 19:52:42,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c409438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:42, skipping insertion in model container [2022-02-20 19:52:42,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:34" (2/3) ... [2022-02-20 19:52:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c409438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:42, skipping insertion in model container [2022-02-20 19:52:42,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:42" (3/3) ... [2022-02-20 19:52:42,160 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label06.c [2022-02-20 19:52:42,162 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:52:42,163 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:52:42,197 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:52:42,202 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:52:42,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:52:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have 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:52:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 19:52:42,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:42,239 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] [2022-02-20 19:52:42,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1031297163, now seen corresponding path program 1 times [2022-02-20 19:52:42,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:42,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246114045] [2022-02-20 19:52:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:42,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#(<= 4 ~a5~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#(<= 4 ~a5~0)} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#(<= 4 ~a5~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#(<= 4 ~a5~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {968#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {968#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {968#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 4 ~a5~0)} is VALID [2022-02-20 19:52:42,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {968#(<= 4 ~a5~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {967#false} is VALID [2022-02-20 19:52:42,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 19:52:42,539 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:52:42,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:42,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246114045] [2022-02-20 19:52:42,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246114045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:42,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:42,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:52:42,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284543599] [2022-02-20 19:52:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:52:42,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:42,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:52:42,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:42,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:52:42,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:52:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:42,590 INFO L87 Difference]: Start difference. First operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:52:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:47,870 INFO L93 Difference]: Finished difference Result 2614 states and 5014 transitions. [2022-02-20 19:52:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:52:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:52:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5014 transitions. [2022-02-20 19:52:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:52:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5014 transitions. [2022-02-20 19:52:47,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5014 transitions. [2022-02-20 19:52:51,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5014 edges. 5014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:51,927 INFO L225 Difference]: With dead ends: 2614 [2022-02-20 19:52:51,928 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:52:51,936 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:52:51,941 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 1126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:51,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 410 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:52:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:52:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:52:52,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:52,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have 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:52:52,043 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have 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:52:52,045 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have 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:52:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:52,139 INFO L93 Difference]: Finished difference Result 1648 states and 3027 transitions. [2022-02-20 19:52:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3027 transitions. [2022-02-20 19:52:52,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:52,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:52,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:52:52,155 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:52:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:52,247 INFO L93 Difference]: Finished difference Result 1648 states and 3027 transitions. [2022-02-20 19:52:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3027 transitions. [2022-02-20 19:52:52,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:52,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:52,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:52,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.839003645200486) internal successors, (3027), 1647 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have 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:52:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 3027 transitions. [2022-02-20 19:52:52,346 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 3027 transitions. Word has length 24 [2022-02-20 19:52:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:52,347 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 3027 transitions. [2022-02-20 19:52:52,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:52:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3027 transitions. [2022-02-20 19:52:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:52:52,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:52,349 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] [2022-02-20 19:52:52,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:52:52,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-02-20 19:52:52,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:52,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252360315] [2022-02-20 19:52:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:52,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {8594#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {8594#true} is VALID [2022-02-20 19:52:52,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {8594#true} is VALID [2022-02-20 19:52:52,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#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~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8594#true} is VALID [2022-02-20 19:52:52,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {8594#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8596#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:52:52,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {8596#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8597#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:52:52,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {8597#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {8598#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:52:52,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {8598#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8595#false} is VALID [2022-02-20 19:52:52,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {8595#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8595#false} is VALID [2022-02-20 19:52:52,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#false} assume !!(main1_~i2~0#1 < 16);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; {8595#false} is VALID [2022-02-20 19:52:52,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {8595#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 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {8595#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {8595#false} ~mode1~0 := 0; {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {8595#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {8595#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {8595#false} ~mode2~0 := 0; {8595#false} is VALID [2022-02-20 19:52:52,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {8595#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {8595#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {8595#false} ~mode3~0 := 0; {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {8595#false} assume !(0 != ~mode4~0 % 256); {8595#false} is VALID [2022-02-20 19:52:52,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {8595#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {8595#false} assume !(0 != ~mode5~0 % 256); {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {8595#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {8595#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {8595#false} is VALID [2022-02-20 19:52:52,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {8595#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {8595#false} assume !(0 != ~mode6~0 % 256); {8595#false} is VALID [2022-02-20 19:52:52,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {8595#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8595#false} is VALID [2022-02-20 19:52:52,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {8595#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {8595#false} is VALID [2022-02-20 19:52:52,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {8595#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {8595#false} assume !(0 != ~mode7~0 % 256); {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {8595#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {8595#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {8595#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {8595#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {8595#false} assume !(node8_~m8~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:52:52,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {8595#false} ~mode8~0 := 0; {8595#false} is VALID [2022-02-20 19:52:52,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {8595#false} assume { :end_inline_node8 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8595#false} is VALID [2022-02-20 19:52:52,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {8595#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {8595#false} is VALID [2022-02-20 19:52:52,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {8595#false} check_#res#1 := check_~tmp~1#1; {8595#false} is VALID [2022-02-20 19:52:52,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {8595#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {8595#false} is VALID [2022-02-20 19:52:52,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {8595#false} assume 0 == assert_~arg#1 % 256; {8595#false} is VALID [2022-02-20 19:52:52,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-02-20 19:52:52,513 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:52:52,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:52,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252360315] [2022-02-20 19:52:52,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252360315] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:52,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:52,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:52:52,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926435358] [2022-02-20 19:52:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:52,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:52:52,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:52,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:52:52,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:52,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:52:52,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:52:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:52:52,554 INFO L87 Difference]: Start difference. First operand 1648 states and 3027 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:52:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:56,705 INFO L93 Difference]: Finished difference Result 1728 states and 3152 transitions. [2022-02-20 19:52:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:52:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:52:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:52:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:52:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:56,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1813 transitions. [2022-02-20 19:52:57,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1813 edges. 1813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:57,931 INFO L225 Difference]: With dead ends: 1728 [2022-02-20 19:52:57,931 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:52:57,935 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:52:57,937 INFO L933 BasicCegarLoop]: 1686 mSDtfsCounter, 3 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:57,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6680 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:52:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:52:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:52:57,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:57,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have 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:52:57,971 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have 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:52:57,973 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have 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:52:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:58,070 INFO L93 Difference]: Finished difference Result 1648 states and 2966 transitions. [2022-02-20 19:52:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2966 transitions. [2022-02-20 19:52:58,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:58,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:58,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:52:58,080 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:52:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:58,164 INFO L93 Difference]: Finished difference Result 1648 states and 2966 transitions. [2022-02-20 19:52:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2966 transitions. [2022-02-20 19:52:58,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:58,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:58,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:58,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.801944106925881) internal successors, (2966), 1647 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have 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:52:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2966 transitions. [2022-02-20 19:52:58,260 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2966 transitions. Word has length 46 [2022-02-20 19:52:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:58,260 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2966 transitions. [2022-02-20 19:52:58,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:52:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2966 transitions. [2022-02-20 19:52:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 19:52:58,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:58,264 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:58,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:52:58,267 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -322142760, now seen corresponding path program 1 times [2022-02-20 19:52:58,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:58,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415406425] [2022-02-20 19:52:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:58,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {15333#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:58,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {15336#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:58,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {15336#(not (= 0 (+ (- 13) ~a24~0)))} assume 6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189;~a2~0 := 236 + (if (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) < 0 && 0 != (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45 then (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45 - 45 else (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45);~a17~0 := 357533 + (if -100855 + ~a17~0 - 172157 < 0 && 0 != (-100855 + ~a17~0 - 172157) % 5 then 1 + (-100855 + ~a17~0 - 172157) / 5 else (-100855 + ~a17~0 - 172157) / 5);~a7~0 := 13;~a24~0 := 14;~a5~0 := 3;calculate_output_#res#1 := 23; {15334#false} is VALID [2022-02-20 19:52:58,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {15334#false} main2_#t~ret62#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret62#1 && main2_#t~ret62#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret62#1;havoc main2_#t~ret62#1; {15334#false} is VALID [2022-02-20 19:52:58,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {15334#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {15334#false} 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 83: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {15334#false} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15334#false} is VALID [2022-02-20 19:52:58,572 INFO L290 TraceCheckUtils]: 92: Hoare triple {15334#false} assume !false; {15334#false} is VALID [2022-02-20 19:52:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:52:58,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:58,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415406425] [2022-02-20 19:52:58,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415406425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:58,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:58,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:52:58,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855930858] [2022-02-20 19:52:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:52:58,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:58,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:52:58,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:58,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:52:58,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:52:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:52:58,645 INFO L87 Difference]: Start difference. First operand 1648 states and 2966 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:10,158 INFO L93 Difference]: Finished difference Result 5405 states and 9856 transitions. [2022-02-20 19:53:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:53:10,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:53:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5839 transitions. [2022-02-20 19:53:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5839 transitions. [2022-02-20 19:53:10,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5839 transitions. [2022-02-20 19:53:13,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5839 edges. 5839 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:14,072 INFO L225 Difference]: With dead ends: 5405 [2022-02-20 19:53:14,073 INFO L226 Difference]: Without dead ends: 3901 [2022-02-20 19:53:14,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:14,075 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 2546 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 6307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:14,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2546 Valid, 899 Invalid, 6307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-02-20 19:53:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2022-02-20 19:53:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 3901. [2022-02-20 19:53:14,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:14,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3901 states. Second operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have 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:53:14,146 INFO L74 IsIncluded]: Start isIncluded. First operand 3901 states. Second operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have 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:53:14,151 INFO L87 Difference]: Start difference. First operand 3901 states. Second operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have 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:53:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:14,571 INFO L93 Difference]: Finished difference Result 3901 states and 6095 transitions. [2022-02-20 19:53:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6095 transitions. [2022-02-20 19:53:14,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:14,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:14,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 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 3901 states. [2022-02-20 19:53:14,589 INFO L87 Difference]: Start difference. First operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 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 3901 states. [2022-02-20 19:53:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:14,989 INFO L93 Difference]: Finished difference Result 3901 states and 6095 transitions. [2022-02-20 19:53:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6095 transitions. [2022-02-20 19:53:14,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:14,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:14,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:14,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3899 states have (on average 1.5632213388048217) internal successors, (6095), 3900 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have 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:53:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6095 transitions. [2022-02-20 19:53:15,453 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6095 transitions. Word has length 93 [2022-02-20 19:53:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:15,454 INFO L470 AbstractCegarLoop]: Abstraction has 3901 states and 6095 transitions. [2022-02-20 19:53:15,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6095 transitions. [2022-02-20 19:53:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 19:53:15,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:15,455 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:15,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1346326019, now seen corresponding path program 1 times [2022-02-20 19:53:15,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:15,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459383588] [2022-02-20 19:53:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:15,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {32533#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,663 INFO L290 TraceCheckUtils]: 67: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:15,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {32535#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} main2_#t~ret62#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret62#1 && main2_#t~ret62#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret62#1;havoc main2_#t~ret62#1; {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,678 INFO L290 TraceCheckUtils]: 81: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,679 INFO L290 TraceCheckUtils]: 82: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:53:15,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {32536#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,684 INFO L290 TraceCheckUtils]: 90: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {32537#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32537#(not (= ~a7~0 13))} is VALID [2022-02-20 19:53:15,690 INFO L290 TraceCheckUtils]: 93: Hoare triple {32537#(not (= ~a7~0 13))} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {32534#false} is VALID [2022-02-20 19:53:15,691 INFO L290 TraceCheckUtils]: 94: Hoare triple {32534#false} assume !false; {32534#false} is VALID [2022-02-20 19:53:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:15,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:15,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459383588] [2022-02-20 19:53:15,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459383588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:53:15,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032443479] [2022-02-20 19:53:15,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:15,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:53:15,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:15,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:53:15,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:53:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:15,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:53:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:15,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:53:16,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {32533#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {32533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {32533#true} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {32533#true} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {32533#true} 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 51: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {32533#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {32533#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {32533#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {32533#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {32533#true} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {32533#true} is VALID [2022-02-20 19:53:16,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {32533#true} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {32533#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {32533#true} is VALID [2022-02-20 19:53:16,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {32533#true} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {32533#true} is VALID [2022-02-20 19:53:16,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {32533#true} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {32533#true} is VALID [2022-02-20 19:53:16,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {32533#true} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {32757#(<= ~a7~0 12)} main2_#t~ret62#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret62#1 && main2_#t~ret62#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret62#1;havoc main2_#t~ret62#1; {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {32757#(<= ~a7~0 12)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {32757#(<= ~a7~0 12)} 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {32757#(<= ~a7~0 12)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {32757#(<= ~a7~0 12)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,103 INFO L290 TraceCheckUtils]: 88: Hoare triple {32757#(<= ~a7~0 12)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,103 INFO L290 TraceCheckUtils]: 89: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {32757#(<= ~a7~0 12)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,104 INFO L290 TraceCheckUtils]: 91: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {32757#(<= ~a7~0 12)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32757#(<= ~a7~0 12)} is VALID [2022-02-20 19:53:16,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {32757#(<= ~a7~0 12)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {32534#false} is VALID [2022-02-20 19:53:16,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {32534#false} assume !false; {32534#false} is VALID [2022-02-20 19:53:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:16,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:53:16,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032443479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:16,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 19:53:16,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-20 19:53:16,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393770180] [2022-02-20 19:53:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:53:16,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:16,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:16,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:16,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:16,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:53:16,166 INFO L87 Difference]: Start difference. First operand 3901 states and 6095 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:24,233 INFO L93 Difference]: Finished difference Result 10662 states and 17147 transitions. [2022-02-20 19:53:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:53:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:53:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:53:24,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4500 transitions. [2022-02-20 19:53:26,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4500 edges. 4500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:28,140 INFO L225 Difference]: With dead ends: 10662 [2022-02-20 19:53:28,140 INFO L226 Difference]: Without dead ends: 6905 [2022-02-20 19:53:28,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:53:28,151 INFO L933 BasicCegarLoop]: 1158 mSDtfsCounter, 767 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:28,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 1354 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:53:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2022-02-20 19:53:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6905. [2022-02-20 19:53:28,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:28,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 0 states have 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:53:28,287 INFO L74 IsIncluded]: Start isIncluded. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 0 states have 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:53:28,295 INFO L87 Difference]: Start difference. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 0 states have 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:53:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:29,943 INFO L93 Difference]: Finished difference Result 6905 states and 10575 transitions. [2022-02-20 19:53:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 10575 transitions. [2022-02-20 19:53:29,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:29,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:29,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 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 6905 states. [2022-02-20 19:53:29,962 INFO L87 Difference]: Start difference. First operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 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 6905 states. [2022-02-20 19:53:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:31,263 INFO L93 Difference]: Finished difference Result 6905 states and 10575 transitions. [2022-02-20 19:53:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 10575 transitions. [2022-02-20 19:53:31,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:31,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:31,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:31,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6905 states, 6903 states have (on average 1.5319426336375488) internal successors, (10575), 6904 states have internal predecessors, (10575), 0 states have call successors, (0), 0 states have 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:53:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6905 states to 6905 states and 10575 transitions. [2022-02-20 19:53:32,852 INFO L78 Accepts]: Start accepts. Automaton has 6905 states and 10575 transitions. Word has length 95 [2022-02-20 19:53:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:32,852 INFO L470 AbstractCegarLoop]: Abstraction has 6905 states and 10575 transitions. [2022-02-20 19:53:32,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 10575 transitions. [2022-02-20 19:53:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:32,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:32,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:53:33,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:53:33,069 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-02-20 19:53:33,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:33,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218780189] [2022-02-20 19:53:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:33,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {64339#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {64339#true} is VALID [2022-02-20 19:53:33,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {64339#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {64339#true} is VALID [2022-02-20 19:53:33,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {64339#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#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~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64339#true} is VALID [2022-02-20 19:53:33,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {64339#true} assume 0 == ~r1~0; {64339#true} is VALID [2022-02-20 19:53:33,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {64339#true} assume ~id1~0 >= 0; {64339#true} is VALID [2022-02-20 19:53:33,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {64339#true} assume 0 == ~st1~0; {64339#true} is VALID [2022-02-20 19:53:33,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {64339#true} assume ~send1~0 == ~id1~0; {64339#true} is VALID [2022-02-20 19:53:33,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {64339#true} assume 0 == ~mode1~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {64341#(= (+ (* (- 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 16);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; {64341#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {64341#(= (+ (* (- 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 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {64340#false} assume !(node1_~m1~0#1 != ~nomsg~0); {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {64340#false} ~mode1~0 := 0; {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {64340#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; {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {64340#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 74: Hoare triple {64340#false} assume !(node2_~m2~0#1 != ~nomsg~0); {64340#false} is VALID [2022-02-20 19:53:33,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {64340#false} ~mode2~0 := 0; {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {64340#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; {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {64340#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {64340#false} assume !(node3_~m3~0#1 != ~nomsg~0); {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {64340#false} ~mode3~0 := 0; {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {64340#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; {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {64340#false} assume !(0 != ~mode4~0 % 256); {64340#false} is VALID [2022-02-20 19:53:33,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {64340#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 83: Hoare triple {64340#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {64340#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; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 85: Hoare triple {64340#false} assume !(0 != ~mode5~0 % 256); {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {64340#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 87: Hoare triple {64340#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 88: Hoare triple {64340#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 89: Hoare triple {64340#false} assume !(0 != ~mode6~0 % 256); {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 90: Hoare triple {64340#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {64340#false} is VALID [2022-02-20 19:53:33,193 INFO L290 TraceCheckUtils]: 91: Hoare triple {64340#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 92: Hoare triple {64340#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {64340#false} assume !(0 != ~mode7~0 % 256); {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {64340#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {64340#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 96: Hoare triple {64340#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 97: Hoare triple {64340#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 98: Hoare triple {64340#false} assume !(node8_~m8~0#1 != ~nomsg~0); {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 99: Hoare triple {64340#false} ~mode8~0 := 0; {64340#false} is VALID [2022-02-20 19:53:33,194 INFO L290 TraceCheckUtils]: 100: Hoare triple {64340#false} assume { :end_inline_node8 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64340#false} is VALID [2022-02-20 19:53:33,195 INFO L290 TraceCheckUtils]: 101: Hoare triple {64340#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {64340#false} is VALID [2022-02-20 19:53:33,195 INFO L290 TraceCheckUtils]: 102: Hoare triple {64340#false} check_#res#1 := check_~tmp~1#1; {64340#false} is VALID [2022-02-20 19:53:33,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {64340#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {64340#false} is VALID [2022-02-20 19:53:33,195 INFO L290 TraceCheckUtils]: 104: Hoare triple {64340#false} assume 0 == assert_~arg#1 % 256; {64340#false} is VALID [2022-02-20 19:53:33,195 INFO L290 TraceCheckUtils]: 105: Hoare triple {64340#false} assume !false; {64340#false} is VALID [2022-02-20 19:53:33,196 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:53:33,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:33,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218780189] [2022-02-20 19:53:33,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218780189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:33,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:33,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:33,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341342451] [2022-02-20 19:53:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:33,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:33,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:33,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:33,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:33,269 INFO L87 Difference]: Start difference. First operand 6905 states and 10575 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:36,562 INFO L93 Difference]: Finished difference Result 7051 states and 10807 transitions. [2022-02-20 19:53:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:36,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:37,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:39,410 INFO L225 Difference]: With dead ends: 7051 [2022-02-20 19:53:39,410 INFO L226 Difference]: Without dead ends: 6975 [2022-02-20 19:53:39,411 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:53:39,411 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1550 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1853 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:53:39,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1550 Valid, 1853 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2022-02-20 19:53:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6973. [2022-02-20 19:53:39,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:39,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6975 states. Second operand has 6973 states, 6971 states have (on average 1.53263520298379) internal successors, (10684), 6972 states have internal predecessors, (10684), 0 states have call successors, (0), 0 states have 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:53:39,536 INFO L74 IsIncluded]: Start isIncluded. First operand 6975 states. Second operand has 6973 states, 6971 states have (on average 1.53263520298379) internal successors, (10684), 6972 states have internal predecessors, (10684), 0 states have call successors, (0), 0 states have 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:53:39,542 INFO L87 Difference]: Start difference. First operand 6975 states. Second operand has 6973 states, 6971 states have (on average 1.53263520298379) internal successors, (10684), 6972 states have internal predecessors, (10684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)