./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:23:57,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:23:57,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:23:57,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:23:57,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:23:57,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:23:57,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:23:57,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:23:57,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:23:57,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:23:57,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:23:57,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:23:57,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:23:57,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:23:57,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:23:57,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:23:57,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:23:57,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:23:57,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:23:57,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:23:57,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:23:57,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:23:57,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:23:57,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:23:57,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:23:57,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:23:57,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:23:57,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:23:57,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:23:57,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:23:57,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:23:57,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:23:57,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:23:57,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:23:57,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:23:57,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:23:57,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:23:57,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:23:57,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:23:57,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:23:57,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:23:57,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:23:57,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:23:57,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:23:57,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:23:57,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:23:57,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:23:57,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:23:57,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:23:57,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:23:57,753 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:23:57,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:23:57,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:23:57,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:23:57,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:23:57,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:23:57,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:23:57,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:23:57,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:23:57,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:23:57,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:23:57,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:23:57,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:23:57,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:23:57,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:23:57,758 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2022-02-20 18:23:57,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:23:57,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:23:57,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:23:57,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:23:57,956 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:23:57,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:23:58,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/197667956/3d57b8bff8b8418cb43df4a231f48c15/FLAG26d7119d8 [2022-02-20 18:23:58,354 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:23:58,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:23:58,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/197667956/3d57b8bff8b8418cb43df4a231f48c15/FLAG26d7119d8 [2022-02-20 18:23:58,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/197667956/3d57b8bff8b8418cb43df4a231f48c15 [2022-02-20 18:23:58,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:23:58,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:23:58,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:23:58,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:23:58,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:23:58,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:58,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32dd49b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58, skipping insertion in model container [2022-02-20 18:23:58,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:58,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:23:58,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:23:59,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2022-02-20 18:23:59,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:23:59,037 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:23:59,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2022-02-20 18:23:59,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:23:59,095 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:23:59,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59 WrapperNode [2022-02-20 18:23:59,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:23:59,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:23:59,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:23:59,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:23:59,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,153 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 431 [2022-02-20 18:23:59,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:23:59,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:23:59,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:23:59,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:23:59,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:23:59,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:23:59,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:23:59,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:23:59,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (1/1) ... [2022-02-20 18:23:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:23:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:23:59,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:23:59,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:23:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:23:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:23:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:23:59,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:23:59,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:23:59,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:23:59,907 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:23:59,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:23:59,913 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:23:59,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:23:59 BoogieIcfgContainer [2022-02-20 18:23:59,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:23:59,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:23:59,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:23:59,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:23:59,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:23:58" (1/3) ... [2022-02-20 18:23:59,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a93ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:23:59, skipping insertion in model container [2022-02-20 18:23:59,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:59" (2/3) ... [2022-02-20 18:23:59,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a93ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:23:59, skipping insertion in model container [2022-02-20 18:23:59,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:23:59" (3/3) ... [2022-02-20 18:23:59,920 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:23:59,923 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:23:59,924 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:23:59,963 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:23:59,973 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:23:59,973 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:23:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.7364341085271318) internal successors, (224), 130 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:00,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:00,002 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] [2022-02-20 18:24:00,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1238377303, now seen corresponding path program 1 times [2022-02-20 18:24:00,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:00,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469627919] [2022-02-20 18:24:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:00,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {134#true} is VALID [2022-02-20 18:24:00,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {134#true} is VALID [2022-02-20 18:24:00,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:00,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {134#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:00,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {134#true} is VALID [2022-02-20 18:24:00,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {134#true} init_#res#1 := init_~tmp___5~0#1; {134#true} is VALID [2022-02-20 18:24:00,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {134#true} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {134#true} is VALID [2022-02-20 18:24:00,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {135#false} is VALID [2022-02-20 18:24:00,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {135#false} is VALID [2022-02-20 18:24:00,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {135#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {135#false} is VALID [2022-02-20 18:24:00,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {135#false} assume !(0 != ~mode1~0 % 256); {135#false} is VALID [2022-02-20 18:24:00,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {135#false} assume !(~r1~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:00,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {135#false} ~mode1~0 := 1; {135#false} is VALID [2022-02-20 18:24:00,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {135#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {135#false} is VALID [2022-02-20 18:24:00,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {135#false} assume !(0 != ~mode2~0 % 256); {135#false} is VALID [2022-02-20 18:24:00,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {135#false} assume !(~r2~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:00,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {135#false} ~mode2~0 := 1; {135#false} is VALID [2022-02-20 18:24:00,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {135#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {135#false} is VALID [2022-02-20 18:24:00,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {135#false} assume !(0 != ~mode3~0 % 256); {135#false} is VALID [2022-02-20 18:24:00,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {135#false} assume !(~r3~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:00,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {135#false} ~mode3~0 := 1; {135#false} is VALID [2022-02-20 18:24:00,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {135#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {135#false} is VALID [2022-02-20 18:24:00,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {135#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {135#false} is VALID [2022-02-20 18:24:00,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {135#false} check_#res#1 := check_~tmp~1#1; {135#false} is VALID [2022-02-20 18:24:00,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {135#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {135#false} is VALID [2022-02-20 18:24:00,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {135#false} assume 0 == assert_~arg#1 % 256; {135#false} is VALID [2022-02-20 18:24:00,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-02-20 18:24:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:00,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:00,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469627919] [2022-02-20 18:24:00,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469627919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:00,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:00,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:00,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068855276] [2022-02-20 18:24:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:00,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:00,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:00,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:00,332 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.7364341085271318) internal successors, (224), 130 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,468 INFO L93 Difference]: Finished difference Result 208 states and 355 transitions. [2022-02-20 18:24:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-02-20 18:24:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-02-20 18:24:00,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 355 transitions. [2022-02-20 18:24:00,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,759 INFO L225 Difference]: With dead ends: 208 [2022-02-20 18:24:00,759 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:00,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:00,764 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:00,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:00,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:00,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,791 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,792 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,797 INFO L93 Difference]: Finished difference Result 127 states and 217 transitions. [2022-02-20 18:24:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 217 transitions. [2022-02-20 18:24:00,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:00,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:00,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:00,800 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,805 INFO L93 Difference]: Finished difference Result 127 states and 217 transitions. [2022-02-20 18:24:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 217 transitions. [2022-02-20 18:24:00,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:00,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:00,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:00,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 126 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 217 transitions. [2022-02-20 18:24:00,813 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 217 transitions. Word has length 37 [2022-02-20 18:24:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:00,813 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 217 transitions. [2022-02-20 18:24:00,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 217 transitions. [2022-02-20 18:24:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:00,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:00,816 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] [2022-02-20 18:24:00,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:00,817 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 420728853, now seen corresponding path program 1 times [2022-02-20 18:24:00,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:00,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469923193] [2022-02-20 18:24:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:00,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {754#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {754#true} is VALID [2022-02-20 18:24:00,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {754#true} is VALID [2022-02-20 18:24:00,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {754#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {754#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {754#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {754#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {754#true} is VALID [2022-02-20 18:24:00,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {754#true} is VALID [2022-02-20 18:24:00,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {756#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:00,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {757#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:00,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {758#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:24:00,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {758#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {755#false} is VALID [2022-02-20 18:24:00,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {755#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {755#false} is VALID [2022-02-20 18:24:00,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {755#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {755#false} assume !(0 != ~mode1~0 % 256); {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {755#false} assume !(~r1~0 % 256 < 2); {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {755#false} ~mode1~0 := 1; {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {755#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {755#false} assume !(0 != ~mode2~0 % 256); {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {755#false} assume !(~r2~0 % 256 < 2); {755#false} is VALID [2022-02-20 18:24:00,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {755#false} ~mode2~0 := 1; {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {755#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {755#false} assume !(0 != ~mode3~0 % 256); {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {755#false} assume !(~r3~0 % 256 < 2); {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {755#false} ~mode3~0 := 1; {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {755#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {755#false} is VALID [2022-02-20 18:24:00,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {755#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {755#false} is VALID [2022-02-20 18:24:00,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {755#false} check_#res#1 := check_~tmp~1#1; {755#false} is VALID [2022-02-20 18:24:00,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {755#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {755#false} is VALID [2022-02-20 18:24:00,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {755#false} assume 0 == assert_~arg#1 % 256; {755#false} is VALID [2022-02-20 18:24:00,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-02-20 18:24:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:00,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:00,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469923193] [2022-02-20 18:24:00,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469923193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:00,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:00,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:00,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282436942] [2022-02-20 18:24:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:00,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:00,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:00,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:01,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:01,001 INFO L87 Difference]: Start difference. First operand 127 states and 217 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,396 INFO L93 Difference]: Finished difference Result 207 states and 348 transitions. [2022-02-20 18:24:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:24:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 348 transitions. [2022-02-20 18:24:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 348 transitions. [2022-02-20 18:24:01,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 348 transitions. [2022-02-20 18:24:01,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:01,621 INFO L225 Difference]: With dead ends: 207 [2022-02-20 18:24:01,621 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:01,621 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 18:24:01,622 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:01,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 836 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:01,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:01,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,627 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,628 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,630 INFO L93 Difference]: Finished difference Result 127 states and 196 transitions. [2022-02-20 18:24:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2022-02-20 18:24:01,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:01,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:01,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:01,631 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,634 INFO L93 Difference]: Finished difference Result 127 states and 196 transitions. [2022-02-20 18:24:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2022-02-20 18:24:01,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:01,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:01,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:01,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 196 transitions. [2022-02-20 18:24:01,651 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 196 transitions. Word has length 37 [2022-02-20 18:24:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:01,651 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 196 transitions. [2022-02-20 18:24:01,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2022-02-20 18:24:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:24:01,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:01,652 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] [2022-02-20 18:24:01,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:01,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1846122567, now seen corresponding path program 1 times [2022-02-20 18:24:01,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:01,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143798708] [2022-02-20 18:24:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:01,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {1380#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {1380#true} is VALID [2022-02-20 18:24:01,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1380#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1380#true} is VALID [2022-02-20 18:24:01,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1380#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {1380#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {1380#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1380#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {1380#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1380#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1380#true} is VALID [2022-02-20 18:24:01,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#true} assume ~id1~0 != ~id2~0; {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#true} assume ~id1~0 != ~id3~0; {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#true} assume ~id2~0 != ~id3~0; {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#true} assume ~id1~0 >= 0; {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#true} assume ~id2~0 >= 0; {1380#true} is VALID [2022-02-20 18:24:01,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#true} assume ~id3~0 >= 0; {1380#true} is VALID [2022-02-20 18:24:01,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#true} assume 0 == ~r1~0 % 256; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:01,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {1382#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1381#false} is VALID [2022-02-20 18:24:01,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {1381#false} ~mode1~0 := 1; {1381#false} is VALID [2022-02-20 18:24:01,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {1381#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {1381#false} assume !(0 != ~mode2~0 % 256); {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {1381#false} assume !(~r2~0 % 256 < 2); {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {1381#false} ~mode2~0 := 1; {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {1381#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {1381#false} assume !(0 != ~mode3~0 % 256); {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {1381#false} assume !(~r3~0 % 256 < 2); {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {1381#false} ~mode3~0 := 1; {1381#false} is VALID [2022-02-20 18:24:01,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {1381#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {1381#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {1381#false} check_#res#1 := check_~tmp~1#1; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {1381#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {1381#false} assume 0 == assert_~arg#1 % 256; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2022-02-20 18:24:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:01,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:01,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143798708] [2022-02-20 18:24:01,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143798708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:01,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:01,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:01,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303724506] [2022-02-20 18:24:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:24:01,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:01,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:01,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:01,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:01,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:01,814 INFO L87 Difference]: Start difference. First operand 127 states and 196 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,018 INFO L93 Difference]: Finished difference Result 270 states and 433 transitions. [2022-02-20 18:24:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:24:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-02-20 18:24:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-02-20 18:24:02,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 433 transitions. [2022-02-20 18:24:02,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:02,287 INFO L225 Difference]: With dead ends: 270 [2022-02-20 18:24:02,287 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 18:24:02,287 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 18:24:02,288 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 101 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:02,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 349 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 18:24:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-02-20 18:24:02,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:02,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,310 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,311 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,315 INFO L93 Difference]: Finished difference Result 194 states and 300 transitions. [2022-02-20 18:24:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 300 transitions. [2022-02-20 18:24:02,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:02,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:02,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 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 194 states. [2022-02-20 18:24:02,316 INFO L87 Difference]: Start difference. First operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 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 194 states. [2022-02-20 18:24:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,320 INFO L93 Difference]: Finished difference Result 194 states and 300 transitions. [2022-02-20 18:24:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 300 transitions. [2022-02-20 18:24:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:02,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:02,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:02,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.568421052631579) internal successors, (298), 190 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2022-02-20 18:24:02,325 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 57 [2022-02-20 18:24:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:02,326 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2022-02-20 18:24:02,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2022-02-20 18:24:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:24:02,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:02,327 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] [2022-02-20 18:24:02,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:02,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1343531320, now seen corresponding path program 1 times [2022-02-20 18:24:02,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:02,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177415777] [2022-02-20 18:24:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:02,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {2276#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {2276#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {2276#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {2276#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {2276#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {2276#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {2276#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {2276#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {2276#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {2276#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {2276#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {2276#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2276#true} is VALID [2022-02-20 18:24:02,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {2276#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {2276#true} assume ~id1~0 != ~id2~0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {2276#true} assume ~id1~0 != ~id3~0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {2276#true} assume ~id2~0 != ~id3~0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {2276#true} assume ~id1~0 >= 0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2276#true} assume ~id2~0 >= 0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {2276#true} assume ~id3~0 >= 0; {2276#true} is VALID [2022-02-20 18:24:02,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {2276#true} assume 0 == ~r1~0 % 256; {2276#true} is VALID [2022-02-20 18:24:02,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#true} assume 0 == ~r2~0 % 256; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:02,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {2278#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2277#false} is VALID [2022-02-20 18:24:02,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {2277#false} ~mode2~0 := 1; {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {2277#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {2277#false} assume !(0 != ~mode3~0 % 256); {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {2277#false} assume !(~r3~0 % 256 < 2); {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {2277#false} ~mode3~0 := 1; {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 53: Hoare triple {2277#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {2277#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2277#false} is VALID [2022-02-20 18:24:02,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {2277#false} check_#res#1 := check_~tmp~1#1; {2277#false} is VALID [2022-02-20 18:24:02,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {2277#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2277#false} is VALID [2022-02-20 18:24:02,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {2277#false} assume 0 == assert_~arg#1 % 256; {2277#false} is VALID [2022-02-20 18:24:02,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {2277#false} assume !false; {2277#false} is VALID [2022-02-20 18:24:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:02,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:02,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177415777] [2022-02-20 18:24:02,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177415777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:02,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:02,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:02,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153710454] [2022-02-20 18:24:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:24:02,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:02,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:02,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:02,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:02,476 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,707 INFO L93 Difference]: Finished difference Result 457 states and 730 transitions. [2022-02-20 18:24:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:24:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-02-20 18:24:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-02-20 18:24:02,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 437 transitions. [2022-02-20 18:24:02,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:02,996 INFO L225 Difference]: With dead ends: 457 [2022-02-20 18:24:02,996 INFO L226 Difference]: Without dead ends: 317 [2022-02-20 18:24:02,997 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 18:24:02,998 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 103 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:02,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 362 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-02-20 18:24:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2022-02-20 18:24:03,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:03,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,034 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,034 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,044 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-02-20 18:24:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-02-20 18:24:03,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 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 317 states. [2022-02-20 18:24:03,047 INFO L87 Difference]: Start difference. First operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 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 317 states. [2022-02-20 18:24:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,054 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-02-20 18:24:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-02-20 18:24:03,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:03,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.5833333333333333) internal successors, (494), 312 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 494 transitions. [2022-02-20 18:24:03,071 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 494 transitions. Word has length 59 [2022-02-20 18:24:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:03,071 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 494 transitions. [2022-02-20 18:24:03,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 494 transitions. [2022-02-20 18:24:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:24:03,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:03,072 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] [2022-02-20 18:24:03,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:03,072 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1628241783, now seen corresponding path program 1 times [2022-02-20 18:24:03,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:03,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991711746] [2022-02-20 18:24:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {3767#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {3767#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {3767#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {3767#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {3767#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {3767#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {3767#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {3767#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {3767#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {3767#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {3767#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {3767#true} assume ~id1~0 != ~id2~0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {3767#true} assume ~id1~0 != ~id3~0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {3767#true} assume ~id2~0 != ~id3~0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {3767#true} assume ~id1~0 >= 0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {3767#true} assume ~id2~0 >= 0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {3767#true} assume ~id3~0 >= 0; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {3767#true} assume 0 == ~r1~0 % 256; {3767#true} is VALID [2022-02-20 18:24:03,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {3767#true} assume 0 == ~r2~0 % 256; {3767#true} is VALID [2022-02-20 18:24:03,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {3767#true} assume 0 == ~r3~0 % 256; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {3769#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3768#false} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {3768#false} ~mode3~0 := 1; {3768#false} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {3768#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3768#false} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {3768#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3768#false} is VALID [2022-02-20 18:24:03,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {3768#false} check_#res#1 := check_~tmp~1#1; {3768#false} is VALID [2022-02-20 18:24:03,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {3768#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3768#false} is VALID [2022-02-20 18:24:03,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {3768#false} assume 0 == assert_~arg#1 % 256; {3768#false} is VALID [2022-02-20 18:24:03,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-02-20 18:24:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:03,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:03,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991711746] [2022-02-20 18:24:03,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991711746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:03,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:03,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:03,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990415004] [2022-02-20 18:24:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:03,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:24:03,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:03,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:03,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:03,194 INFO L87 Difference]: Start difference. First operand 313 states and 494 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,463 INFO L93 Difference]: Finished difference Result 809 states and 1292 transitions. [2022-02-20 18:24:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:24:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-02-20 18:24:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-02-20 18:24:03,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 437 transitions. [2022-02-20 18:24:03,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,742 INFO L225 Difference]: With dead ends: 809 [2022-02-20 18:24:03,743 INFO L226 Difference]: Without dead ends: 547 [2022-02-20 18:24:03,743 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 18:24:03,744 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 97 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:03,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 363 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-20 18:24:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 541. [2022-02-20 18:24:03,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:03,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,802 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,803 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,814 INFO L93 Difference]: Finished difference Result 547 states and 859 transitions. [2022-02-20 18:24:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 859 transitions. [2022-02-20 18:24:03,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:03,817 INFO L87 Difference]: Start difference. First operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,828 INFO L93 Difference]: Finished difference Result 547 states and 859 transitions. [2022-02-20 18:24:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 859 transitions. [2022-02-20 18:24:03,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:03,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.5814814814814815) internal successors, (854), 540 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 854 transitions. [2022-02-20 18:24:03,842 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 854 transitions. Word has length 61 [2022-02-20 18:24:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:03,842 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 854 transitions. [2022-02-20 18:24:03,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 854 transitions. [2022-02-20 18:24:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:03,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:03,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:03,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:03,844 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1563109830, now seen corresponding path program 1 times [2022-02-20 18:24:03,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:03,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052603528] [2022-02-20 18:24:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:03,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {6378#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {6378#true} is VALID [2022-02-20 18:24:03,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {6378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6378#true} is VALID [2022-02-20 18:24:03,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {6378#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {6378#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {6378#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {6378#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {6378#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {6378#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {6378#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {6378#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {6378#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {6378#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {6378#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {6378#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {6378#true} assume ~id1~0 != ~id2~0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {6378#true} assume ~id1~0 != ~id3~0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {6378#true} assume ~id2~0 != ~id3~0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {6378#true} assume ~id1~0 >= 0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {6378#true} assume ~id2~0 >= 0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {6378#true} assume ~id3~0 >= 0; {6378#true} is VALID [2022-02-20 18:24:03,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {6378#true} assume 0 == ~r1~0 % 256; {6378#true} is VALID [2022-02-20 18:24:03,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {6378#true} assume 0 == ~r2~0 % 256; {6378#true} is VALID [2022-02-20 18:24:03,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {6378#true} assume 0 == ~r3~0 % 256; {6378#true} is VALID [2022-02-20 18:24:03,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {6378#true} assume ~max1~0 == ~id1~0; {6378#true} is VALID [2022-02-20 18:24:03,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {6378#true} assume ~max2~0 == ~id2~0; {6378#true} is VALID [2022-02-20 18:24:03,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {6378#true} assume ~max3~0 == ~id3~0; {6378#true} is VALID [2022-02-20 18:24:03,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {6378#true} assume 0 == ~st1~0; {6380#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:03,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {6380#(<= ~st1~0 0)} assume 0 == ~st2~0; {6381#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {6381#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:03,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {6382#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6379#false} is VALID [2022-02-20 18:24:03,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {6379#false} check_#res#1 := check_~tmp~1#1; {6379#false} is VALID [2022-02-20 18:24:03,954 INFO L290 TraceCheckUtils]: 60: Hoare triple {6379#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6379#false} is VALID [2022-02-20 18:24:03,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {6379#false} assume 0 == assert_~arg#1 % 256; {6379#false} is VALID [2022-02-20 18:24:03,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {6379#false} assume !false; {6379#false} is VALID [2022-02-20 18:24:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:03,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:03,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052603528] [2022-02-20 18:24:03,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052603528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:03,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:03,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:03,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114060350] [2022-02-20 18:24:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:03,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:03,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:03,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:03,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:03,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:03,993 INFO L87 Difference]: Start difference. First operand 541 states and 854 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:05,122 INFO L93 Difference]: Finished difference Result 2333 states and 3776 transitions. [2022-02-20 18:24:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2022-02-20 18:24:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2022-02-20 18:24:05,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 958 transitions. [2022-02-20 18:24:05,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 958 edges. 958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:05,823 INFO L225 Difference]: With dead ends: 2333 [2022-02-20 18:24:05,824 INFO L226 Difference]: Without dead ends: 1843 [2022-02-20 18:24:05,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:24:05,825 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 828 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:05,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 1143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-02-20 18:24:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 969. [2022-02-20 18:24:05,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:05,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1843 states. Second operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:05,999 INFO L74 IsIncluded]: Start isIncluded. First operand 1843 states. Second operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:06,000 INFO L87 Difference]: Start difference. First operand 1843 states. Second operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:06,095 INFO L93 Difference]: Finished difference Result 1843 states and 2965 transitions. [2022-02-20 18:24:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2965 transitions. [2022-02-20 18:24:06,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:06,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:06,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 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 1843 states. [2022-02-20 18:24:06,101 INFO L87 Difference]: Start difference. First operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 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 1843 states. [2022-02-20 18:24:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:06,215 INFO L93 Difference]: Finished difference Result 1843 states and 2965 transitions. [2022-02-20 18:24:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2965 transitions. [2022-02-20 18:24:06,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:06,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:06,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:06,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 1.5919421487603307) internal successors, (1541), 968 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1541 transitions. [2022-02-20 18:24:06,254 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1541 transitions. Word has length 63 [2022-02-20 18:24:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:06,254 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1541 transitions. [2022-02-20 18:24:06,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1541 transitions. [2022-02-20 18:24:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:24:06,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:06,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:06,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:06,256 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -711068186, now seen corresponding path program 1 times [2022-02-20 18:24:06,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:06,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017880598] [2022-02-20 18:24:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:06,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {13769#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {13769#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {13769#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {13769#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {13769#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {13769#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {13769#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {13769#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {13769#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {13769#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {13769#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {13769#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {13769#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {13769#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {13769#true} is VALID [2022-02-20 18:24:06,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {13769#true} assume ~id1~0 != ~id2~0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {13769#true} assume ~id1~0 != ~id3~0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {13769#true} assume ~id2~0 != ~id3~0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {13769#true} assume ~id1~0 >= 0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {13769#true} assume ~id2~0 >= 0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {13769#true} assume ~id3~0 >= 0; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {13769#true} assume 0 == ~r1~0 % 256; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {13769#true} assume 0 == ~r2~0 % 256; {13769#true} is VALID [2022-02-20 18:24:06,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {13769#true} assume 0 == ~r3~0 % 256; {13769#true} is VALID [2022-02-20 18:24:06,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {13769#true} assume ~max1~0 == ~id1~0; {13769#true} is VALID [2022-02-20 18:24:06,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {13769#true} assume ~max2~0 == ~id2~0; {13769#true} is VALID [2022-02-20 18:24:06,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {13769#true} assume ~max3~0 == ~id3~0; {13769#true} is VALID [2022-02-20 18:24:06,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {13769#true} assume 0 == ~st1~0; {13771#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:06,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {13771#(<= ~st1~0 0)} assume 0 == ~st2~0; {13771#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:06,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {13771#(<= ~st1~0 0)} assume 0 == ~st3~0; {13771#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:06,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {13771#(<= ~st1~0 0)} assume 0 == ~nl1~0; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13772#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:06,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {13772#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {13770#false} is VALID [2022-02-20 18:24:06,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {13770#false} check_#res#1 := check_~tmp~1#1; {13770#false} is VALID [2022-02-20 18:24:06,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {13770#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13770#false} is VALID [2022-02-20 18:24:06,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {13770#false} assume 0 == assert_~arg#1 % 256; {13770#false} is VALID [2022-02-20 18:24:06,353 INFO L290 TraceCheckUtils]: 63: Hoare triple {13770#false} assume !false; {13770#false} is VALID [2022-02-20 18:24:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:06,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:06,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017880598] [2022-02-20 18:24:06,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017880598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:06,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:06,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:06,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907178827] [2022-02-20 18:24:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:24:06,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:06,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:06,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:06,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:06,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:06,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:06,390 INFO L87 Difference]: Start difference. First operand 969 states and 1541 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:07,362 INFO L93 Difference]: Finished difference Result 2831 states and 4571 transitions. [2022-02-20 18:24:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:24:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:07,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 577 transitions. [2022-02-20 18:24:07,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:07,811 INFO L225 Difference]: With dead ends: 2831 [2022-02-20 18:24:07,811 INFO L226 Difference]: Without dead ends: 1913 [2022-02-20 18:24:07,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:24:07,812 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 363 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:07,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 644 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-02-20 18:24:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1432. [2022-02-20 18:24:08,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:08,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1913 states. Second operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,110 INFO L74 IsIncluded]: Start isIncluded. First operand 1913 states. Second operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,112 INFO L87 Difference]: Start difference. First operand 1913 states. Second operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:08,208 INFO L93 Difference]: Finished difference Result 1913 states and 3085 transitions. [2022-02-20 18:24:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 3085 transitions. [2022-02-20 18:24:08,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:08,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:08,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1913 states. [2022-02-20 18:24:08,214 INFO L87 Difference]: Start difference. First operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1913 states. [2022-02-20 18:24:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:08,320 INFO L93 Difference]: Finished difference Result 1913 states and 3085 transitions. [2022-02-20 18:24:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 3085 transitions. [2022-02-20 18:24:08,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:08,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:08,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:08,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.6009783368273933) internal successors, (2291), 1431 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2291 transitions. [2022-02-20 18:24:08,383 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2291 transitions. Word has length 64 [2022-02-20 18:24:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:08,384 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 2291 transitions. [2022-02-20 18:24:08,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2291 transitions. [2022-02-20 18:24:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:08,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:08,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:08,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:08,385 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1972861693, now seen corresponding path program 1 times [2022-02-20 18:24:08,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:08,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583288555] [2022-02-20 18:24:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:08,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {22370#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {22370#true} is VALID [2022-02-20 18:24:08,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {22370#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {22370#true} is VALID [2022-02-20 18:24:08,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {22370#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {22370#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {22370#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {22370#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {22370#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {22370#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {22370#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {22370#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {22370#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {22370#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {22370#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {22370#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {22370#true} assume ~id1~0 != ~id2~0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {22370#true} assume ~id1~0 != ~id3~0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {22370#true} assume ~id2~0 != ~id3~0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {22370#true} assume ~id1~0 >= 0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {22370#true} assume ~id2~0 >= 0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {22370#true} assume ~id3~0 >= 0; {22370#true} is VALID [2022-02-20 18:24:08,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {22370#true} assume 0 == ~r1~0 % 256; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {22370#true} assume 0 == ~r2~0 % 256; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {22370#true} assume 0 == ~r3~0 % 256; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {22370#true} assume ~max1~0 == ~id1~0; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {22370#true} assume ~max2~0 == ~id2~0; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {22370#true} assume ~max3~0 == ~id3~0; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {22370#true} assume 0 == ~st1~0; {22370#true} is VALID [2022-02-20 18:24:08,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {22370#true} assume 0 == ~st2~0; {22372#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:08,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {22372#(<= ~st2~0 0)} assume 0 == ~st3~0; {22372#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:08,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {22372#(<= ~st2~0 0)} assume 0 == ~nl1~0; {22372#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:08,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {22372#(<= ~st2~0 0)} assume 0 == ~nl2~0; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {22373#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:08,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {22373#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {22371#false} is VALID [2022-02-20 18:24:08,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {22371#false} check_#res#1 := check_~tmp~1#1; {22371#false} is VALID [2022-02-20 18:24:08,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {22371#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22371#false} is VALID [2022-02-20 18:24:08,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {22371#false} assume 0 == assert_~arg#1 % 256; {22371#false} is VALID [2022-02-20 18:24:08,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {22371#false} assume !false; {22371#false} is VALID [2022-02-20 18:24:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:08,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:08,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583288555] [2022-02-20 18:24:08,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583288555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:08,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:08,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:08,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184184328] [2022-02-20 18:24:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:24:08,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:08,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:08,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:08,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:08,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:08,491 INFO L87 Difference]: Start difference. First operand 1432 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:10,091 INFO L93 Difference]: Finished difference Result 4159 states and 6709 transitions. [2022-02-20 18:24:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:24:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:10,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 577 transitions. [2022-02-20 18:24:10,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:10,657 INFO L225 Difference]: With dead ends: 4159 [2022-02-20 18:24:10,658 INFO L226 Difference]: Without dead ends: 2778 [2022-02-20 18:24:10,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:24:10,659 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 363 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:10,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 643 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-02-20 18:24:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2093. [2022-02-20 18:24:11,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:11,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2778 states. Second operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,355 INFO L74 IsIncluded]: Start isIncluded. First operand 2778 states. Second operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,357 INFO L87 Difference]: Start difference. First operand 2778 states. Second operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:11,553 INFO L93 Difference]: Finished difference Result 2778 states and 4467 transitions. [2022-02-20 18:24:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4467 transitions. [2022-02-20 18:24:11,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:11,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:11,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 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 2778 states. [2022-02-20 18:24:11,560 INFO L87 Difference]: Start difference. First operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 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 2778 states. [2022-02-20 18:24:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:11,752 INFO L93 Difference]: Finished difference Result 2778 states and 4467 transitions. [2022-02-20 18:24:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4467 transitions. [2022-02-20 18:24:11,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:11,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:11,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:11,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2092 states have (on average 1.6003824091778203) internal successors, (3348), 2092 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3348 transitions. [2022-02-20 18:24:11,883 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3348 transitions. Word has length 65 [2022-02-20 18:24:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:11,884 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 3348 transitions. [2022-02-20 18:24:11,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3348 transitions. [2022-02-20 18:24:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:24:11,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:11,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:11,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:11,886 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:11,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash -555653635, now seen corresponding path program 1 times [2022-02-20 18:24:11,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:11,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819401530] [2022-02-20 18:24:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:11,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {34921#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {34921#true} is VALID [2022-02-20 18:24:11,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {34921#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {34921#true} is VALID [2022-02-20 18:24:11,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {34921#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {34921#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {34921#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {34921#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {34921#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {34921#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {34921#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {34921#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {34921#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {34921#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {34921#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {34921#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {34921#true} assume ~id1~0 != ~id2~0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {34921#true} assume ~id1~0 != ~id3~0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {34921#true} assume ~id2~0 != ~id3~0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {34921#true} assume ~id1~0 >= 0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {34921#true} assume ~id2~0 >= 0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {34921#true} assume ~id3~0 >= 0; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {34921#true} assume 0 == ~r1~0 % 256; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {34921#true} assume 0 == ~r2~0 % 256; {34921#true} is VALID [2022-02-20 18:24:11,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {34921#true} assume 0 == ~r3~0 % 256; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {34921#true} assume ~max1~0 == ~id1~0; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {34921#true} assume ~max2~0 == ~id2~0; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {34921#true} assume ~max3~0 == ~id3~0; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {34921#true} assume 0 == ~st1~0; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {34921#true} assume 0 == ~st2~0; {34921#true} is VALID [2022-02-20 18:24:11,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {34921#true} assume 0 == ~st3~0; {34923#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:11,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {34923#(<= ~st3~0 0)} assume 0 == ~nl1~0; {34923#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:11,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {34923#(<= ~st3~0 0)} assume 0 == ~nl2~0; {34923#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:11,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {34923#(<= ~st3~0 0)} assume 0 == ~nl3~0; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {34924#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:11,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {34924#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {34922#false} is VALID [2022-02-20 18:24:11,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {34922#false} check_#res#1 := check_~tmp~1#1; {34922#false} is VALID [2022-02-20 18:24:11,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {34922#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {34922#false} is VALID [2022-02-20 18:24:11,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {34922#false} assume 0 == assert_~arg#1 % 256; {34922#false} is VALID [2022-02-20 18:24:11,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {34922#false} assume !false; {34922#false} is VALID [2022-02-20 18:24:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:11,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:11,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819401530] [2022-02-20 18:24:11,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819401530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:11,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:11,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:11,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397714585] [2022-02-20 18:24:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:11,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:11,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:11,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:11,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:11,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:11,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:11,981 INFO L87 Difference]: Start difference. First operand 2093 states and 3348 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:14,630 INFO L93 Difference]: Finished difference Result 6043 states and 9733 transitions. [2022-02-20 18:24:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-02-20 18:24:14,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 577 transitions. [2022-02-20 18:24:14,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:15,529 INFO L225 Difference]: With dead ends: 6043 [2022-02-20 18:24:15,529 INFO L226 Difference]: Without dead ends: 4001 [2022-02-20 18:24:15,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:24:15,532 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 361 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:15,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2022-02-20 18:24:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 3031. [2022-02-20 18:24:16,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:16,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4001 states. Second operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:16,557 INFO L74 IsIncluded]: Start isIncluded. First operand 4001 states. Second operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:16,559 INFO L87 Difference]: Start difference. First operand 4001 states. Second operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:16,975 INFO L93 Difference]: Finished difference Result 4001 states and 6426 transitions. [2022-02-20 18:24:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 6426 transitions. [2022-02-20 18:24:16,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:16,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:16,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 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 4001 states. [2022-02-20 18:24:16,985 INFO L87 Difference]: Start difference. First operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 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 4001 states. [2022-02-20 18:24:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:17,431 INFO L93 Difference]: Finished difference Result 4001 states and 6426 transitions. [2022-02-20 18:24:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 6426 transitions. [2022-02-20 18:24:17,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:17,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:17,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:17,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 3030 states have (on average 1.5986798679867986) internal successors, (4844), 3030 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 4844 transitions. [2022-02-20 18:24:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 4844 transitions. Word has length 66 [2022-02-20 18:24:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:17,705 INFO L470 AbstractCegarLoop]: Abstraction has 3031 states and 4844 transitions. [2022-02-20 18:24:17,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 4844 transitions. [2022-02-20 18:24:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:24:17,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:17,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:17,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:24:17,706 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash -378063148, now seen corresponding path program 1 times [2022-02-20 18:24:17,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:17,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40752852] [2022-02-20 18:24:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:17,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {53067#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {53067#true} is VALID [2022-02-20 18:24:17,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {53067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {53067#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {53067#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {53067#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {53067#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {53067#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {53067#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {53067#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {53067#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {53067#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {53067#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {53067#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {53067#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {53067#true} assume ~id1~0 != ~id2~0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {53067#true} assume ~id1~0 != ~id3~0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {53067#true} assume ~id2~0 != ~id3~0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {53067#true} assume ~id1~0 >= 0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {53067#true} assume ~id2~0 >= 0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {53067#true} assume ~id3~0 >= 0; {53067#true} is VALID [2022-02-20 18:24:17,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {53067#true} assume 0 == ~r1~0 % 256; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {53067#true} assume 0 == ~r2~0 % 256; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {53067#true} assume 0 == ~r3~0 % 256; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {53067#true} assume ~max1~0 == ~id1~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {53067#true} assume ~max2~0 == ~id2~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {53067#true} assume ~max3~0 == ~id3~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {53067#true} assume 0 == ~st1~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {53067#true} assume 0 == ~st2~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {53067#true} assume 0 == ~st3~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {53067#true} assume 0 == ~nl1~0; {53067#true} is VALID [2022-02-20 18:24:17,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {53067#true} assume 0 == ~nl2~0; {53067#true} is VALID [2022-02-20 18:24:17,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {53067#true} assume 0 == ~nl3~0; {53067#true} is VALID [2022-02-20 18:24:17,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {53067#true} assume 0 == ~mode1~0 % 256; {53067#true} is VALID [2022-02-20 18:24:17,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {53067#true} assume 0 == ~mode2~0 % 256; {53067#true} is VALID [2022-02-20 18:24:17,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {53067#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {53069#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {53068#false} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {53068#false} assume !(255 == ~r3~0 % 256); {53068#false} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {53068#false} ~r3~0 := 1 + ~r3~0 % 256; {53068#false} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {53068#false} assume !(0 != ~ep13~0 % 256); {53068#false} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {53068#false} assume !(0 != ~ep23~0 % 256); {53068#false} is VALID [2022-02-20 18:24:17,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {53068#false} assume 2 == ~r3~0 % 256; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {53068#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {53068#false} ~mode3~0 := 0; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {53068#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {53068#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {53068#false} check_#res#1 := check_~tmp~1#1; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {53068#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {53068#false} assume 0 == assert_~arg#1 % 256; {53068#false} is VALID [2022-02-20 18:24:17,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {53068#false} assume !false; {53068#false} is VALID [2022-02-20 18:24:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:17,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:17,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40752852] [2022-02-20 18:24:17,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40752852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:17,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:17,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:17,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114670830] [2022-02-20 18:24:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:17,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:17,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:17,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:17,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:17,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:17,809 INFO L87 Difference]: Start difference. First operand 3031 states and 4844 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:21,243 INFO L93 Difference]: Finished difference Result 6926 states and 11080 transitions. [2022-02-20 18:24:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:21,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:24:21,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:22,184 INFO L225 Difference]: With dead ends: 6926 [2022-02-20 18:24:22,184 INFO L226 Difference]: Without dead ends: 4772 [2022-02-20 18:24:22,189 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 18:24:22,190 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 96 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 402 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 18:24:22,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2022-02-20 18:24:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4770. [2022-02-20 18:24:23,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:23,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4772 states. Second operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:23,869 INFO L74 IsIncluded]: Start isIncluded. First operand 4772 states. Second operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:23,872 INFO L87 Difference]: Start difference. First operand 4772 states. Second operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:24,463 INFO L93 Difference]: Finished difference Result 4772 states and 7559 transitions. [2022-02-20 18:24:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 7559 transitions. [2022-02-20 18:24:24,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:24,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 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 4772 states. [2022-02-20 18:24:24,475 INFO L87 Difference]: Start difference. First operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 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 4772 states. [2022-02-20 18:24:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:25,076 INFO L93 Difference]: Finished difference Result 4772 states and 7559 transitions. [2022-02-20 18:24:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 7559 transitions. [2022-02-20 18:24:25,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:25,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:25,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:25,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4769 states have (on average 1.5848186202558188) internal successors, (7558), 4769 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 7558 transitions. [2022-02-20 18:24:25,764 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 7558 transitions. Word has length 66 [2022-02-20 18:24:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:25,764 INFO L470 AbstractCegarLoop]: Abstraction has 4770 states and 7558 transitions. [2022-02-20 18:24:25,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 7558 transitions. [2022-02-20 18:24:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:24:25,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:25,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:25,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:24:25,766 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1715532573, now seen corresponding path program 1 times [2022-02-20 18:24:25,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:25,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552150028] [2022-02-20 18:24:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:25,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {75790#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {75790#true} is VALID [2022-02-20 18:24:25,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {75790#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {75790#true} is VALID [2022-02-20 18:24:25,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {75790#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {75790#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {75790#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {75790#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {75790#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {75790#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {75790#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {75790#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {75790#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {75790#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {75790#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {75790#true} is VALID [2022-02-20 18:24:25,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {75790#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {75790#true} assume ~id1~0 != ~id2~0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {75790#true} assume ~id1~0 != ~id3~0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {75790#true} assume ~id2~0 != ~id3~0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {75790#true} assume ~id1~0 >= 0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {75790#true} assume ~id2~0 >= 0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {75790#true} assume ~id3~0 >= 0; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {75790#true} assume 0 == ~r1~0 % 256; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {75790#true} assume 0 == ~r2~0 % 256; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {75790#true} assume 0 == ~r3~0 % 256; {75790#true} is VALID [2022-02-20 18:24:25,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {75790#true} assume ~max1~0 == ~id1~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {75790#true} assume ~max2~0 == ~id2~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {75790#true} assume ~max3~0 == ~id3~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {75790#true} assume 0 == ~st1~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {75790#true} assume 0 == ~st2~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {75790#true} assume 0 == ~st3~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {75790#true} assume 0 == ~nl1~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {75790#true} assume 0 == ~nl2~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {75790#true} assume 0 == ~nl3~0; {75790#true} is VALID [2022-02-20 18:24:25,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {75790#true} assume 0 == ~mode1~0 % 256; {75790#true} is VALID [2022-02-20 18:24:25,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {75790#true} assume 0 == ~mode2~0 % 256; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {75792#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {75791#false} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {75791#false} assume !(255 == ~r2~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {75791#false} ~r2~0 := 1 + ~r2~0 % 256; {75791#false} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {75791#false} assume !(0 != ~ep12~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {75791#false} assume !(0 != ~ep32~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {75791#false} assume 2 == ~r2~0 % 256; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {75791#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {75791#false} ~mode2~0 := 0; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {75791#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {75791#false} assume !(0 != ~mode3~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {75791#false} assume ~r3~0 % 256 < 2; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {75791#false} assume !(0 != ~ep31~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {75791#false} assume !(0 != ~ep32~0 % 256); {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {75791#false} ~mode3~0 := 1; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {75791#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {75791#false} is VALID [2022-02-20 18:24:25,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {75791#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {75791#false} is VALID [2022-02-20 18:24:25,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {75791#false} check_#res#1 := check_~tmp~1#1; {75791#false} is VALID [2022-02-20 18:24:25,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {75791#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {75791#false} is VALID [2022-02-20 18:24:25,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {75791#false} assume 0 == assert_~arg#1 % 256; {75791#false} is VALID [2022-02-20 18:24:25,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {75791#false} assume !false; {75791#false} is VALID [2022-02-20 18:24:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:25,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:25,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552150028] [2022-02-20 18:24:25,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552150028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:25,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:25,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:25,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932900706] [2022-02-20 18:24:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:25,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:25,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:25,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:25,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:25,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:25,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:25,875 INFO L87 Difference]: Start difference. First operand 4770 states and 7558 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,985 INFO L93 Difference]: Finished difference Result 10466 states and 16644 transitions. [2022-02-20 18:24:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:31,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:24:32,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,854 INFO L225 Difference]: With dead ends: 10466 [2022-02-20 18:24:33,854 INFO L226 Difference]: Without dead ends: 7109 [2022-02-20 18:24:33,856 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 18:24:33,857 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 102 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 431 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 18:24:33,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 431 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2022-02-20 18:24:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 7107. [2022-02-20 18:24:36,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:36,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7109 states. Second operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:36,517 INFO L74 IsIncluded]: Start isIncluded. First operand 7109 states. Second operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:36,524 INFO L87 Difference]: Start difference. First operand 7109 states. Second operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:37,956 INFO L93 Difference]: Finished difference Result 7109 states and 11198 transitions. [2022-02-20 18:24:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 11198 transitions. [2022-02-20 18:24:37,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:37,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:37,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 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 7109 states. [2022-02-20 18:24:37,973 INFO L87 Difference]: Start difference. First operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 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 7109 states. [2022-02-20 18:24:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:39,401 INFO L93 Difference]: Finished difference Result 7109 states and 11198 transitions. [2022-02-20 18:24:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 11198 transitions. [2022-02-20 18:24:39,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:39,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:39,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:39,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7107 states, 7106 states have (on average 1.5757106670419363) internal successors, (11197), 7106 states have internal predecessors, (11197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7107 states to 7107 states and 11197 transitions. [2022-02-20 18:24:41,014 INFO L78 Accepts]: Start accepts. Automaton has 7107 states and 11197 transitions. Word has length 66 [2022-02-20 18:24:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:41,014 INFO L470 AbstractCegarLoop]: Abstraction has 7107 states and 11197 transitions. [2022-02-20 18:24:41,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7107 states and 11197 transitions. [2022-02-20 18:24:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:24:41,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:41,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:41,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:24:41,015 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1204542386, now seen corresponding path program 1 times [2022-02-20 18:24:41,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:41,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823717860] [2022-02-20 18:24:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:41,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {110043#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {110043#true} is VALID [2022-02-20 18:24:41,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {110043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {110043#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {110043#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {110043#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {110043#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {110043#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {110043#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {110043#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {110043#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {110043#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {110043#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {110043#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {110043#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {110043#true} assume ~id1~0 != ~id2~0; {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {110043#true} assume ~id1~0 != ~id3~0; {110043#true} is VALID [2022-02-20 18:24:41,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {110043#true} assume ~id2~0 != ~id3~0; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {110043#true} assume ~id1~0 >= 0; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {110043#true} assume ~id2~0 >= 0; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {110043#true} assume ~id3~0 >= 0; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {110043#true} assume 0 == ~r1~0 % 256; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {110043#true} assume 0 == ~r2~0 % 256; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {110043#true} assume 0 == ~r3~0 % 256; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {110043#true} assume ~max1~0 == ~id1~0; {110043#true} is VALID [2022-02-20 18:24:41,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {110043#true} assume ~max2~0 == ~id2~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {110043#true} assume ~max3~0 == ~id3~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {110043#true} assume 0 == ~st1~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {110043#true} assume 0 == ~st2~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {110043#true} assume 0 == ~st3~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {110043#true} assume 0 == ~nl1~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {110043#true} assume 0 == ~nl2~0; {110043#true} is VALID [2022-02-20 18:24:41,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {110043#true} assume 0 == ~nl3~0; {110043#true} is VALID [2022-02-20 18:24:41,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {110043#true} assume 0 == ~mode1~0 % 256; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:41,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {110045#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {110044#false} is VALID [2022-02-20 18:24:41,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {110044#false} assume !(255 == ~r1~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {110044#false} ~r1~0 := 1 + ~r1~0 % 256; {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {110044#false} assume !(0 != ~ep21~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {110044#false} assume !(0 != ~ep31~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {110044#false} assume 2 == ~r1~0 % 256; {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {110044#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {110044#false} is VALID [2022-02-20 18:24:41,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {110044#false} ~mode1~0 := 0; {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {110044#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {110044#false} assume !(0 != ~mode2~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {110044#false} assume ~r2~0 % 256 < 2; {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {110044#false} assume !(0 != ~ep21~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {110044#false} assume !(0 != ~ep23~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {110044#false} ~mode2~0 := 1; {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {110044#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {110044#false} assume !(0 != ~mode3~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {110044#false} assume ~r3~0 % 256 < 2; {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {110044#false} assume !(0 != ~ep31~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {110044#false} assume !(0 != ~ep32~0 % 256); {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {110044#false} ~mode3~0 := 1; {110044#false} is VALID [2022-02-20 18:24:41,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {110044#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {110044#false} is VALID [2022-02-20 18:24:41,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {110044#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {110044#false} is VALID [2022-02-20 18:24:41,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {110044#false} check_#res#1 := check_~tmp~1#1; {110044#false} is VALID [2022-02-20 18:24:41,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {110044#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {110044#false} is VALID [2022-02-20 18:24:41,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {110044#false} assume 0 == assert_~arg#1 % 256; {110044#false} is VALID [2022-02-20 18:24:41,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {110044#false} assume !false; {110044#false} is VALID [2022-02-20 18:24:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:41,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:41,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823717860] [2022-02-20 18:24:41,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823717860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:41,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:41,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:41,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557267194] [2022-02-20 18:24:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:41,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:41,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:41,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:41,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:41,114 INFO L87 Difference]: Start difference. First operand 7107 states and 11197 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,972 INFO L93 Difference]: Finished difference Result 15863 states and 25260 transitions. [2022-02-20 18:24:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:24:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:24:53,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:24:54,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:57,542 INFO L225 Difference]: With dead ends: 15863 [2022-02-20 18:24:57,542 INFO L226 Difference]: Without dead ends: 10685 [2022-02-20 18:24:57,545 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 18:24:57,546 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 108 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 452 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 18:24:57,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 452 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-02-20 18:25:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 10683. [2022-02-20 18:25:01,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:01,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10685 states. Second operand has 10683 states, 10682 states have (on average 1.5719902639955066) internal successors, (16792), 10682 states have internal predecessors, (16792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:01,756 INFO L74 IsIncluded]: Start isIncluded. First operand 10685 states. Second operand has 10683 states, 10682 states have (on average 1.5719902639955066) internal successors, (16792), 10682 states have internal predecessors, (16792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:01,763 INFO L87 Difference]: Start difference. First operand 10685 states. Second operand has 10683 states, 10682 states have (on average 1.5719902639955066) internal successors, (16792), 10682 states have internal predecessors, (16792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:04,753 INFO L93 Difference]: Finished difference Result 10685 states and 16793 transitions. [2022-02-20 18:25:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10685 states and 16793 transitions. [2022-02-20 18:25:04,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:04,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:04,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 10683 states, 10682 states have (on average 1.5719902639955066) internal successors, (16792), 10682 states have internal predecessors, (16792), 0 states have call successors, (0), 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 10685 states. [2022-02-20 18:25:04,780 INFO L87 Difference]: Start difference. First operand has 10683 states, 10682 states have (on average 1.5719902639955066) internal successors, (16792), 10682 states have internal predecessors, (16792), 0 states have call successors, (0), 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 10685 states.