./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.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.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 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:46,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:46,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:46,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:46,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:46,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:46,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:46,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:46,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:46,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:46,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:46,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:46,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:46,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:46,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:46,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:46,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:46,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:46,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:46,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:46,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:46,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:46,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:46,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:46,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:46,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:46,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:46,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:46,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:46,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:46,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:46,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:46,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:46,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:46,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:46,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:46,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:46,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:46,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:46,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:46,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:46,115 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:24:46,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:46,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:46,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:46,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:46,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:46,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:46,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:46,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:46,132 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:46,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:46,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:46,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:46,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:46,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:46,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:46,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:46,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:46,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:46,135 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:46,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:46,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:46,136 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 -> 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c [2022-02-20 18:24:46,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:46,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:46,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:46,367 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:46,368 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:46,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:46,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca01b8f0/c9f2c611b6e24be5992d8e2b555d331b/FLAG2854bedbc [2022-02-20 18:24:46,793 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:46,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:46,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca01b8f0/c9f2c611b6e24be5992d8e2b555d331b/FLAG2854bedbc [2022-02-20 18:24:46,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca01b8f0/c9f2c611b6e24be5992d8e2b555d331b [2022-02-20 18:24:46,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:46,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:46,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:46,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:46,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:46,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:46" (1/1) ... [2022-02-20 18:24:46,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffae557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:46, skipping insertion in model container [2022-02-20 18:24:46,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:46" (1/1) ... [2022-02-20 18:24:46,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:46,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:47,060 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.ufo.UNBOUNDED.pals.c[12966,12979] [2022-02-20 18:24:47,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:47,068 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:47,108 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.ufo.UNBOUNDED.pals.c[12966,12979] [2022-02-20 18:24:47,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:47,119 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:47,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47 WrapperNode [2022-02-20 18:24:47,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:47,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:47,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:47,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:47,130 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:24:47" (1/1) ... [2022-02-20 18:24:47,141 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:24:47" (1/1) ... [2022-02-20 18:24:47,185 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2022-02-20 18:24:47,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:47,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:47,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:47,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:47,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:47,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:47,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:47,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:47,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:47,276 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:24:47,283 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:24:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:47,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:47,386 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:47,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:47,951 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:47,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:47,959 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:47,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:47 BoogieIcfgContainer [2022-02-20 18:24:47,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:47,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:47,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:47,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:47,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:46" (1/3) ... [2022-02-20 18:24:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7885f50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:47, skipping insertion in model container [2022-02-20 18:24:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (2/3) ... [2022-02-20 18:24:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7885f50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:47, skipping insertion in model container [2022-02-20 18:24:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:47" (3/3) ... [2022-02-20 18:24:47,971 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:47,975 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:47,976 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:48,021 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:48,026 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:24:48,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:48,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:48,057 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:48,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash 298975739, now seen corresponding path program 1 times [2022-02-20 18:24:48,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:48,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527117477] [2022-02-20 18:24:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:48,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(37, 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; {140#true} is VALID [2022-02-20 18:24:48,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#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; {140#true} is VALID [2022-02-20 18:24:48,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {140#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {140#true} init_#res#1 := init_~tmp___5~0#1; {140#true} is VALID [2022-02-20 18:24:48,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {140#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; {140#true} is VALID [2022-02-20 18:24:48,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {140#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {141#false} is VALID [2022-02-20 18:24:48,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {141#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; {141#false} is VALID [2022-02-20 18:24:48,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {141#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {141#false} is VALID [2022-02-20 18:24:48,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {141#false} assume !(0 != ~mode1~0 % 256); {141#false} is VALID [2022-02-20 18:24:48,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {141#false} assume !(~r1~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:48,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {141#false} ~mode1~0 := 1; {141#false} is VALID [2022-02-20 18:24:48,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {141#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {141#false} is VALID [2022-02-20 18:24:48,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {141#false} assume !(0 != ~mode2~0 % 256); {141#false} is VALID [2022-02-20 18:24:48,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {141#false} assume !(~r2~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:48,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {141#false} ~mode2~0 := 1; {141#false} is VALID [2022-02-20 18:24:48,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {141#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {141#false} is VALID [2022-02-20 18:24:48,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {141#false} assume !(0 != ~mode3~0 % 256); {141#false} is VALID [2022-02-20 18:24:48,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {141#false} assume !(~r3~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:48,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {141#false} ~mode3~0 := 1; {141#false} is VALID [2022-02-20 18:24:48,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {141#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; {141#false} is VALID [2022-02-20 18:24:48,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {141#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {141#false} is VALID [2022-02-20 18:24:48,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {141#false} check_#res#1 := check_~tmp~1#1; {141#false} is VALID [2022-02-20 18:24:48,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {141#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; {141#false} is VALID [2022-02-20 18:24:48,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {141#false} assume 0 == assert_~arg#1 % 256; {141#false} is VALID [2022-02-20 18:24:48,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 18:24:48,304 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:48,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:48,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527117477] [2022-02-20 18:24:48,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527117477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:48,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:48,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:48,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105254431] [2022-02-20 18:24:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:48,309 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:48,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:48,312 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:48,347 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:48,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:48,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:48,371 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 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:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,538 INFO L93 Difference]: Finished difference Result 214 states and 367 transitions. [2022-02-20 18:24:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:48,538 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:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:48,539 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:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:48,549 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:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:48,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 367 transitions. [2022-02-20 18:24:48,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:48,832 INFO L225 Difference]: With dead ends: 214 [2022-02-20 18:24:48,832 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:48,834 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:48,836 INFO L933 BasicCegarLoop]: 229 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, 229 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:48,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 229 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:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:48,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:48,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:48,863 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:48,863 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,868 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:48,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:48,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:48,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:48,870 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,875 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:48,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:48,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:48,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:48,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 229 transitions. [2022-02-20 18:24:48,884 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 229 transitions. Word has length 37 [2022-02-20 18:24:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:48,885 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 229 transitions. [2022-02-20 18:24:48,885 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:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:48,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:48,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] [2022-02-20 18:24:48,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:48,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -518672711, now seen corresponding path program 1 times [2022-02-20 18:24:48,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:48,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162058263] [2022-02-20 18:24:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:48,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#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(37, 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; {784#true} is VALID [2022-02-20 18:24:48,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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; {784#true} is VALID [2022-02-20 18:24:48,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {784#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {784#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {784#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:48,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:48,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:48,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {787#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:48,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(= |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; {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:24:48,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {785#false} is VALID [2022-02-20 18:24:48,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#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; {785#false} is VALID [2022-02-20 18:24:48,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {785#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {785#false} is VALID [2022-02-20 18:24:48,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {785#false} assume !(0 != ~mode1~0 % 256); {785#false} is VALID [2022-02-20 18:24:48,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {785#false} assume !(~r1~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:48,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {785#false} ~mode1~0 := 1; {785#false} is VALID [2022-02-20 18:24:48,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {785#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {785#false} is VALID [2022-02-20 18:24:48,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {785#false} assume !(0 != ~mode2~0 % 256); {785#false} is VALID [2022-02-20 18:24:48,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {785#false} assume !(~r2~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:48,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {785#false} ~mode2~0 := 1; {785#false} is VALID [2022-02-20 18:24:48,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {785#false} assume !(0 != ~mode3~0 % 256); {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} assume !(~r3~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} ~mode3~0 := 1; {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#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; {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {785#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {785#false} is VALID [2022-02-20 18:24:48,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {785#false} check_#res#1 := check_~tmp~1#1; {785#false} is VALID [2022-02-20 18:24:48,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {785#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; {785#false} is VALID [2022-02-20 18:24:48,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {785#false} assume 0 == assert_~arg#1 % 256; {785#false} is VALID [2022-02-20 18:24:48,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-02-20 18:24:48,983 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:48,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:48,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162058263] [2022-02-20 18:24:48,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162058263] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:48,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:48,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:48,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960141887] [2022-02-20 18:24:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:48,985 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:48,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:48,986 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:49,007 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:49,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:49,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:49,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:49,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:49,010 INFO L87 Difference]: Start difference. First operand 133 states and 229 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:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,389 INFO L93 Difference]: Finished difference Result 213 states and 360 transitions. [2022-02-20 18:24:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:24:49,390 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:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:49,390 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:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:49,393 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:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:49,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 360 transitions. [2022-02-20 18:24:49,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:49,620 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:24:49,620 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:49,620 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:49,621 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:49,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 878 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:49,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:49,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:49,626 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:49,627 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,629 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:49,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:49,631 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,635 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:49,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2022-02-20 18:24:49,639 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2022-02-20 18:24:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:49,639 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2022-02-20 18:24:49,639 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:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:49,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:49,640 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:49,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:49,640 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash -707453694, now seen corresponding path program 1 times [2022-02-20 18:24:49,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:49,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881178036] [2022-02-20 18:24:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:49,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#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(37, 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; {1434#true} is VALID [2022-02-20 18:24:49,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#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; {1434#true} is VALID [2022-02-20 18:24:49,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {1434#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:49,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:49,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~id1~0 != ~id2~0; {1434#true} is VALID [2022-02-20 18:24:49,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#true} assume ~id1~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:49,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} assume ~id2~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:49,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume ~id1~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:49,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume ~id2~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:49,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#true} assume ~id3~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:49,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#true} assume 0 == ~r1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {1436#(<= ~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; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {1436#(<= ~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; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:49,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:49,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {1435#false} ~mode1~0 := 1; {1435#false} is VALID [2022-02-20 18:24:49,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {1435#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {1435#false} assume !(0 != ~mode2~0 % 256); {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {1435#false} assume !(~r2~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {1435#false} ~mode2~0 := 1; {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {1435#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {1435#false} assume !(0 != ~mode3~0 % 256); {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {1435#false} assume !(~r3~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:49,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {1435#false} ~mode3~0 := 1; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {1435#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; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {1435#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {1435#false} check_#res#1 := check_~tmp~1#1; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {1435#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; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {1435#false} assume 0 == assert_~arg#1 % 256; {1435#false} is VALID [2022-02-20 18:24:49,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {1435#false} assume !false; {1435#false} is VALID [2022-02-20 18:24:49,748 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:49,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:49,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881178036] [2022-02-20 18:24:49,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881178036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:49,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:49,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:49,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889924968] [2022-02-20 18:24:49,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:49,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:49,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:49,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:49,785 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:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:49,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:49,787 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,993 INFO L93 Difference]: Finished difference Result 276 states and 439 transitions. [2022-02-20 18:24:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-02-20 18:24:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-02-20 18:24:50,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 439 transitions. [2022-02-20 18:24:50,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:50,273 INFO L225 Difference]: With dead ends: 276 [2022-02-20 18:24:50,273 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 18:24:50,274 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:50,275 INFO L933 BasicCegarLoop]: 195 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, 355 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:50,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 355 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:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 18:24:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2022-02-20 18:24:50,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:50,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:50,296 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:50,296 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,300 INFO L93 Difference]: Finished difference Result 200 states and 306 transitions. [2022-02-20 18:24:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 306 transitions. [2022-02-20 18:24:50,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:24:50,301 INFO L87 Difference]: Start difference. First operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:24:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,305 INFO L93 Difference]: Finished difference Result 200 states and 306 transitions. [2022-02-20 18:24:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 306 transitions. [2022-02-20 18:24:50,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:50,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2022-02-20 18:24:50,309 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 63 [2022-02-20 18:24:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:50,310 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2022-02-20 18:24:50,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2022-02-20 18:24:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:50,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:50,311 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:50,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:50,311 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1995563601, now seen corresponding path program 1 times [2022-02-20 18:24:50,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:50,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362526651] [2022-02-20 18:24:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:50,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {2354#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(37, 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; {2354#true} is VALID [2022-02-20 18:24:50,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {2354#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; {2354#true} is VALID [2022-02-20 18:24:50,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {2354#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {2354#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {2354#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {2354#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {2354#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {2354#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {2354#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {2354#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {2354#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:50,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {2354#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:50,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {2354#true} assume ~id1~0 != ~id2~0; {2354#true} is VALID [2022-02-20 18:24:50,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#true} assume ~id1~0 != ~id3~0; {2354#true} is VALID [2022-02-20 18:24:50,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#true} assume ~id2~0 != ~id3~0; {2354#true} is VALID [2022-02-20 18:24:50,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#true} assume ~id1~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:50,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#true} assume ~id2~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:50,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#true} assume ~id3~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:50,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#true} assume 0 == ~r1~0 % 256; {2354#true} is VALID [2022-02-20 18:24:50,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#true} assume 0 == ~r2~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {2356#(<= ~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; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {2356#(<= ~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; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {2356#(<= ~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; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {2355#false} ~mode2~0 := 1; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {2355#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {2355#false} assume !(0 != ~mode3~0 % 256); {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {2355#false} assume !(~r3~0 % 256 < 2); {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {2355#false} ~mode3~0 := 1; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {2355#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; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {2355#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {2355#false} check_#res#1 := check_~tmp~1#1; {2355#false} is VALID [2022-02-20 18:24:50,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {2355#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; {2355#false} is VALID [2022-02-20 18:24:50,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {2355#false} assume 0 == assert_~arg#1 % 256; {2355#false} is VALID [2022-02-20 18:24:50,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2022-02-20 18:24:50,407 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:50,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:50,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362526651] [2022-02-20 18:24:50,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362526651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:50,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:50,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:50,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885082951] [2022-02-20 18:24:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:50,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,445 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:50,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:50,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:50,446 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,683 INFO L93 Difference]: Finished difference Result 463 states and 736 transitions. [2022-02-20 18:24:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:50,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:50,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:50,993 INFO L225 Difference]: With dead ends: 463 [2022-02-20 18:24:50,994 INFO L226 Difference]: Without dead ends: 323 [2022-02-20 18:24:50,994 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:50,995 INFO L933 BasicCegarLoop]: 199 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, 368 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:50,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 368 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:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-02-20 18:24:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2022-02-20 18:24:51,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:51,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:51,034 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:51,035 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,040 INFO L93 Difference]: Finished difference Result 323 states and 503 transitions. [2022-02-20 18:24:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 503 transitions. [2022-02-20 18:24:51,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 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 323 states. [2022-02-20 18:24:51,042 INFO L87 Difference]: Start difference. First operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 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 323 states. [2022-02-20 18:24:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,048 INFO L93 Difference]: Finished difference Result 323 states and 503 transitions. [2022-02-20 18:24:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 503 transitions. [2022-02-20 18:24:51,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:51,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 500 transitions. [2022-02-20 18:24:51,055 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 500 transitions. Word has length 65 [2022-02-20 18:24:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:51,056 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 500 transitions. [2022-02-20 18:24:51,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 500 transitions. [2022-02-20 18:24:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:51,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:51,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:51,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:51,067 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2137075392, now seen corresponding path program 1 times [2022-02-20 18:24:51,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:51,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917878789] [2022-02-20 18:24:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:51,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#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(37, 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; {3869#true} is VALID [2022-02-20 18:24:51,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#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; {3869#true} is VALID [2022-02-20 18:24:51,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {3869#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {3869#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {3869#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {3869#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {3869#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {3869#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {3869#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {3869#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {3869#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {3869#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {3869#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {3869#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {3869#true} assume ~id1~0 != ~id2~0; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {3869#true} assume ~id1~0 != ~id3~0; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {3869#true} assume ~id2~0 != ~id3~0; {3869#true} is VALID [2022-02-20 18:24:51,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {3869#true} assume ~id1~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:51,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#true} assume ~id2~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:51,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {3869#true} assume ~id3~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:51,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {3869#true} assume 0 == ~r1~0 % 256; {3869#true} is VALID [2022-02-20 18:24:51,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {3869#true} assume 0 == ~r2~0 % 256; {3869#true} is VALID [2022-02-20 18:24:51,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {3869#true} assume 0 == ~r3~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:51,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3870#false} is VALID [2022-02-20 18:24:51,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {3870#false} ~mode3~0 := 1; {3870#false} is VALID [2022-02-20 18:24:51,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#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; {3870#false} is VALID [2022-02-20 18:24:51,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3870#false} is VALID [2022-02-20 18:24:51,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {3870#false} check_#res#1 := check_~tmp~1#1; {3870#false} is VALID [2022-02-20 18:24:51,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {3870#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; {3870#false} is VALID [2022-02-20 18:24:51,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {3870#false} assume 0 == assert_~arg#1 % 256; {3870#false} is VALID [2022-02-20 18:24:51,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {3870#false} assume !false; {3870#false} is VALID [2022-02-20 18:24:51,181 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:51,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:51,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917878789] [2022-02-20 18:24:51,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917878789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:51,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:51,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:51,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403083938] [2022-02-20 18:24:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:51,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:51,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:51,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:51,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:51,222 INFO L87 Difference]: Start difference. First operand 319 states and 500 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,472 INFO L93 Difference]: Finished difference Result 815 states and 1298 transitions. [2022-02-20 18:24:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:51,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:51,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,730 INFO L225 Difference]: With dead ends: 815 [2022-02-20 18:24:51,730 INFO L226 Difference]: Without dead ends: 553 [2022-02-20 18:24:51,730 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:51,731 INFO L933 BasicCegarLoop]: 199 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, 369 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:51,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 369 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:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-02-20 18:24:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 547. [2022-02-20 18:24:51,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:51,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:51,792 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:51,793 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,804 INFO L93 Difference]: Finished difference Result 553 states and 865 transitions. [2022-02-20 18:24:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 865 transitions. [2022-02-20 18:24:51,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 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 553 states. [2022-02-20 18:24:51,807 INFO L87 Difference]: Start difference. First operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 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 553 states. [2022-02-20 18:24:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,819 INFO L93 Difference]: Finished difference Result 553 states and 865 transitions. [2022-02-20 18:24:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 865 transitions. [2022-02-20 18:24:51,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:51,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 860 transitions. [2022-02-20 18:24:51,832 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 860 transitions. Word has length 67 [2022-02-20 18:24:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:51,832 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 860 transitions. [2022-02-20 18:24:51,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 860 transitions. [2022-02-20 18:24:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:51,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:51,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:51,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:51,835 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -544230961, now seen corresponding path program 1 times [2022-02-20 18:24:51,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:51,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757140006] [2022-02-20 18:24:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:51,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {6504#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(37, 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; {6504#true} is VALID [2022-02-20 18:24:51,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {6504#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; {6504#true} is VALID [2022-02-20 18:24:51,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {6504#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {6504#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {6504#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {6504#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {6504#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {6504#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {6504#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {6504#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {6504#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {6504#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {6504#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {6504#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {6504#true} assume ~id1~0 != ~id2~0; {6504#true} is VALID [2022-02-20 18:24:51,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {6504#true} assume ~id1~0 != ~id3~0; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {6504#true} assume ~id2~0 != ~id3~0; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {6504#true} assume ~id1~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {6504#true} assume ~id2~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {6504#true} assume ~id3~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {6504#true} assume 0 == ~r1~0 % 256; {6504#true} is VALID [2022-02-20 18:24:51,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {6504#true} assume 0 == ~r2~0 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {6504#true} assume 0 == ~r3~0 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {6504#true} assume 0 != init_~r122~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {6504#true} assume 0 != init_~r132~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {6504#true} assume 0 != init_~r212~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {6504#true} assume 0 != init_~r232~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {6504#true} assume 0 != init_~r312~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {6504#true} assume 0 != init_~r322~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:51,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {6504#true} assume ~max1~0 == ~id1~0; {6504#true} is VALID [2022-02-20 18:24:51,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {6504#true} assume ~max2~0 == ~id2~0; {6504#true} is VALID [2022-02-20 18:24:51,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {6504#true} assume ~max3~0 == ~id3~0; {6504#true} is VALID [2022-02-20 18:24:51,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {6504#true} assume 0 == ~st1~0; {6506#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:51,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {6506#(<= ~st1~0 0)} assume 0 == ~st2~0; {6507#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {6507#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,916 INFO L290 TraceCheckUtils]: 60: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:51,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6505#false} is VALID [2022-02-20 18:24:51,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {6505#false} check_#res#1 := check_~tmp~1#1; {6505#false} is VALID [2022-02-20 18:24:51,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {6505#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; {6505#false} is VALID [2022-02-20 18:24:51,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {6505#false} assume 0 == assert_~arg#1 % 256; {6505#false} is VALID [2022-02-20 18:24:51,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {6505#false} assume !false; {6505#false} is VALID [2022-02-20 18:24:51,919 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:51,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:51,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757140006] [2022-02-20 18:24:51,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757140006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:51,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:51,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:51,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923718478] [2022-02-20 18:24:51,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:51,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:51,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:51,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:51,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:51,976 INFO L87 Difference]: Start difference. First operand 547 states and 860 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,041 INFO L93 Difference]: Finished difference Result 2339 states and 3782 transitions. [2022-02-20 18:24:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:53,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:53,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 964 transitions. [2022-02-20 18:24:53,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:53,719 INFO L225 Difference]: With dead ends: 2339 [2022-02-20 18:24:53,719 INFO L226 Difference]: Without dead ends: 1849 [2022-02-20 18:24:53,720 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:53,721 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 861 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:53,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 1129 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-02-20 18:24:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 975. [2022-02-20 18:24:53,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:53,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,902 INFO L74 IsIncluded]: Start isIncluded. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,903 INFO L87 Difference]: Start difference. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,998 INFO L93 Difference]: Finished difference Result 1849 states and 2971 transitions. [2022-02-20 18:24:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2971 transitions. [2022-02-20 18:24:54,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:54,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:54,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 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 1849 states. [2022-02-20 18:24:54,004 INFO L87 Difference]: Start difference. First operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 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 1849 states. [2022-02-20 18:24:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:54,099 INFO L93 Difference]: Finished difference Result 1849 states and 2971 transitions. [2022-02-20 18:24:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2971 transitions. [2022-02-20 18:24:54,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:54,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:54,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:54,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1547 transitions. [2022-02-20 18:24:54,149 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1547 transitions. Word has length 69 [2022-02-20 18:24:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:54,150 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1547 transitions. [2022-02-20 18:24:54,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1547 transitions. [2022-02-20 18:24:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:24:54,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:54,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:54,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:54,152 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:54,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1614123231, now seen corresponding path program 1 times [2022-02-20 18:24:54,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:54,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225669825] [2022-02-20 18:24:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:54,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#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(37, 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; {13919#true} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {13919#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; {13919#true} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {13919#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {13919#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {13919#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {13919#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {13919#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {13919#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {13919#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {13919#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {13919#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {13919#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {13919#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {13919#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {13919#true} assume ~id1~0 != ~id2~0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {13919#true} assume ~id1~0 != ~id3~0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {13919#true} assume ~id2~0 != ~id3~0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {13919#true} assume ~id1~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {13919#true} assume ~id2~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {13919#true} assume ~id3~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {13919#true} assume 0 == ~r1~0 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {13919#true} assume 0 == ~r2~0 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {13919#true} assume 0 == ~r3~0 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {13919#true} assume 0 != init_~r122~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {13919#true} assume 0 != init_~r132~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {13919#true} assume 0 != init_~r212~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {13919#true} assume 0 != init_~r232~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {13919#true} assume 0 != init_~r312~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {13919#true} assume 0 != init_~r322~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {13919#true} assume ~max1~0 == ~id1~0; {13919#true} is VALID [2022-02-20 18:24:54,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {13919#true} assume ~max2~0 == ~id2~0; {13919#true} is VALID [2022-02-20 18:24:54,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {13919#true} assume ~max3~0 == ~id3~0; {13919#true} is VALID [2022-02-20 18:24:54,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {13919#true} assume 0 == ~st1~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:54,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~st2~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:54,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~st3~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:54,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~nl1~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {13922#(<= (+ ~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; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {13922#(<= (+ ~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; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {13922#(<= (+ ~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; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {13920#false} is VALID [2022-02-20 18:24:54,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {13920#false} check_#res#1 := check_~tmp~1#1; {13920#false} is VALID [2022-02-20 18:24:54,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {13920#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; {13920#false} is VALID [2022-02-20 18:24:54,270 INFO L290 TraceCheckUtils]: 68: Hoare triple {13920#false} assume 0 == assert_~arg#1 % 256; {13920#false} is VALID [2022-02-20 18:24:54,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2022-02-20 18:24:54,270 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:54,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:54,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225669825] [2022-02-20 18:24:54,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225669825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:54,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:54,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:54,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104026466] [2022-02-20 18:24:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:54,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:24:54,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:54,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:54,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:54,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:54,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:54,307 INFO L87 Difference]: Start difference. First operand 975 states and 1547 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:55,236 INFO L93 Difference]: Finished difference Result 2837 states and 4577 transitions. [2022-02-20 18:24:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:24:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:55,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:55,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:55,682 INFO L225 Difference]: With dead ends: 2837 [2022-02-20 18:24:55,682 INFO L226 Difference]: Without dead ends: 1919 [2022-02-20 18:24:55,683 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:55,684 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 365 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 660 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:55,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 660 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:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-02-20 18:24:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1438. [2022-02-20 18:24:55,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:55,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have 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:55,990 INFO L74 IsIncluded]: Start isIncluded. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have 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:55,992 INFO L87 Difference]: Start difference. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have 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:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:56,086 INFO L93 Difference]: Finished difference Result 1919 states and 3091 transitions. [2022-02-20 18:24:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3091 transitions. [2022-02-20 18:24:56,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:56,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:56,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 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 1919 states. [2022-02-20 18:24:56,093 INFO L87 Difference]: Start difference. First operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 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 1919 states. [2022-02-20 18:24:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:56,187 INFO L93 Difference]: Finished difference Result 1919 states and 3091 transitions. [2022-02-20 18:24:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3091 transitions. [2022-02-20 18:24:56,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:56,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:56,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:56,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have 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:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2297 transitions. [2022-02-20 18:24:56,254 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2297 transitions. Word has length 70 [2022-02-20 18:24:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:56,255 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 2297 transitions. [2022-02-20 18:24:56,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2297 transitions. [2022-02-20 18:24:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:24:56,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:56,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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:56,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:56,257 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash -252040890, now seen corresponding path program 1 times [2022-02-20 18:24:56,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:56,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444659203] [2022-02-20 18:24:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:56,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {22544#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(37, 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; {22544#true} is VALID [2022-02-20 18:24:56,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {22544#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; {22544#true} is VALID [2022-02-20 18:24:56,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {22544#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {22544#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {22544#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {22544#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {22544#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {22544#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {22544#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {22544#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {22544#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {22544#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {22544#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:56,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {22544#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {22544#true} assume ~id1~0 != ~id2~0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {22544#true} assume ~id1~0 != ~id3~0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {22544#true} assume ~id2~0 != ~id3~0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {22544#true} assume ~id1~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {22544#true} assume ~id2~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {22544#true} assume ~id3~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {22544#true} assume 0 == ~r1~0 % 256; {22544#true} is VALID [2022-02-20 18:24:56,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {22544#true} assume 0 == ~r2~0 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {22544#true} assume 0 == ~r3~0 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {22544#true} assume 0 != init_~r122~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {22544#true} assume 0 != init_~r132~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {22544#true} assume 0 != init_~r212~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {22544#true} assume 0 != init_~r232~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {22544#true} assume 0 != init_~r312~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {22544#true} assume 0 != init_~r322~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:56,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {22544#true} assume ~max1~0 == ~id1~0; {22544#true} is VALID [2022-02-20 18:24:56,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {22544#true} assume ~max2~0 == ~id2~0; {22544#true} is VALID [2022-02-20 18:24:56,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {22544#true} assume ~max3~0 == ~id3~0; {22544#true} is VALID [2022-02-20 18:24:56,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {22544#true} assume 0 == ~st1~0; {22544#true} is VALID [2022-02-20 18:24:56,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {22544#true} assume 0 == ~st2~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:56,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~st3~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:56,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~nl1~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:56,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~nl2~0; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {22547#(<= (+ ~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; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {22547#(<= (+ ~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; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {22547#(<= (+ ~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; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:56,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {22545#false} is VALID [2022-02-20 18:24:56,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {22545#false} check_#res#1 := check_~tmp~1#1; {22545#false} is VALID [2022-02-20 18:24:56,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {22545#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; {22545#false} is VALID [2022-02-20 18:24:56,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {22545#false} assume 0 == assert_~arg#1 % 256; {22545#false} is VALID [2022-02-20 18:24:56,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {22545#false} assume !false; {22545#false} is VALID [2022-02-20 18:24:56,323 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:56,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:56,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444659203] [2022-02-20 18:24:56,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444659203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:56,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:56,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:56,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903909182] [2022-02-20 18:24:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:56,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:24:56,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:56,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:56,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:56,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:56,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:56,376 INFO L87 Difference]: Start difference. First operand 1438 states and 2297 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:57,945 INFO L93 Difference]: Finished difference Result 4165 states and 6715 transitions. [2022-02-20 18:24:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:24:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:57,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:58,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:58,512 INFO L225 Difference]: With dead ends: 4165 [2022-02-20 18:24:58,512 INFO L226 Difference]: Without dead ends: 2784 [2022-02-20 18:24:58,514 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:58,514 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 363 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 661 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:58,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 661 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:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2022-02-20 18:24:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2099. [2022-02-20 18:24:59,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:59,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have 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:59,175 INFO L74 IsIncluded]: Start isIncluded. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have 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:59,178 INFO L87 Difference]: Start difference. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have 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:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:59,363 INFO L93 Difference]: Finished difference Result 2784 states and 4473 transitions. [2022-02-20 18:24:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4473 transitions. [2022-02-20 18:24:59,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:59,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:59,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 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 2784 states. [2022-02-20 18:24:59,370 INFO L87 Difference]: Start difference. First operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 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 2784 states. [2022-02-20 18:24:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:59,565 INFO L93 Difference]: Finished difference Result 2784 states and 4473 transitions. [2022-02-20 18:24:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4473 transitions. [2022-02-20 18:24:59,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:59,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:59,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:59,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have 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:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 3354 transitions. [2022-02-20 18:24:59,691 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 3354 transitions. Word has length 71 [2022-02-20 18:24:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:59,691 INFO L470 AbstractCegarLoop]: Abstraction has 2099 states and 3354 transitions. [2022-02-20 18:24:59,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3354 transitions. [2022-02-20 18:24:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:59,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:59,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:59,693 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash -630566449, now seen corresponding path program 1 times [2022-02-20 18:24:59,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:59,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545041053] [2022-02-20 18:24:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:59,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {35119#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(37, 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; {35119#true} is VALID [2022-02-20 18:24:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {35119#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; {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {35119#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {35119#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {35119#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {35119#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {35119#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {35119#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {35119#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {35119#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {35119#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {35119#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {35119#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {35119#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {35119#true} assume ~id1~0 != ~id2~0; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {35119#true} assume ~id1~0 != ~id3~0; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {35119#true} assume ~id2~0 != ~id3~0; {35119#true} is VALID [2022-02-20 18:24:59,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {35119#true} assume ~id1~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {35119#true} assume ~id2~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {35119#true} assume ~id3~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {35119#true} assume 0 == ~r1~0 % 256; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {35119#true} assume 0 == ~r2~0 % 256; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {35119#true} assume 0 == ~r3~0 % 256; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {35119#true} assume 0 != init_~r122~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {35119#true} assume 0 != init_~r132~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {35119#true} assume 0 != init_~r212~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {35119#true} assume 0 != init_~r232~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {35119#true} assume 0 != init_~r312~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {35119#true} assume 0 != init_~r322~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {35119#true} assume ~max1~0 == ~id1~0; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {35119#true} assume ~max2~0 == ~id2~0; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {35119#true} assume ~max3~0 == ~id3~0; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {35119#true} assume 0 == ~st1~0; {35119#true} is VALID [2022-02-20 18:24:59,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {35119#true} assume 0 == ~st2~0; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {35119#true} assume 0 == ~st3~0; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {35119#true} assume 0 == ~nl1~0; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {35119#true} assume 0 == ~nl2~0; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {35119#true} assume 0 == ~nl3~0; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {35119#true} assume 0 == ~mode1~0 % 256; {35119#true} is VALID [2022-02-20 18:24:59,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {35119#true} assume 0 == ~mode2~0 % 256; {35119#true} is VALID [2022-02-20 18:24:59,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {35119#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:59,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:59,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {35120#false} assume !(255 == ~r3~0 % 256); {35120#false} is VALID [2022-02-20 18:24:59,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {35120#false} ~r3~0 := 1 + ~r3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {35120#false} assume !(0 != ~ep13~0 % 256); {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {35120#false} assume !(0 != ~ep23~0 % 256); {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {35120#false} assume 2 == ~r3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {35120#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {35120#false} ~mode3~0 := 0; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {35120#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; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {35120#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {35120#false} is VALID [2022-02-20 18:24:59,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {35120#false} check_#res#1 := check_~tmp~1#1; {35120#false} is VALID [2022-02-20 18:24:59,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {35120#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; {35120#false} is VALID [2022-02-20 18:24:59,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {35120#false} assume 0 == assert_~arg#1 % 256; {35120#false} is VALID [2022-02-20 18:24:59,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {35120#false} assume !false; {35120#false} is VALID [2022-02-20 18:24:59,753 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:59,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:59,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545041053] [2022-02-20 18:24:59,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545041053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:59,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:59,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:59,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247878946] [2022-02-20 18:24:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:24:59,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:59,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:59,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:59,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:59,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:59,806 INFO L87 Difference]: Start difference. First operand 2099 states and 3354 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:01,518 INFO L93 Difference]: Finished difference Result 4342 states and 6948 transitions. [2022-02-20 18:25:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:25:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:01,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:25:01,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:02,110 INFO L225 Difference]: With dead ends: 4342 [2022-02-20 18:25:02,110 INFO L226 Difference]: Without dead ends: 3126 [2022-02-20 18:25:02,112 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:25:02,113 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 96 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 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:25:02,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2022-02-20 18:25:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3124. [2022-02-20 18:25:03,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:03,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have 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:03,182 INFO L74 IsIncluded]: Start isIncluded. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have 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:03,185 INFO L87 Difference]: Start difference. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have 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:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:03,445 INFO L93 Difference]: Finished difference Result 3126 states and 4951 transitions. [2022-02-20 18:25:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4951 transitions. [2022-02-20 18:25:03,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:03,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:03,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 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 3126 states. [2022-02-20 18:25:03,463 INFO L87 Difference]: Start difference. First operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 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 3126 states. [2022-02-20 18:25:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:03,731 INFO L93 Difference]: Finished difference Result 3126 states and 4951 transitions. [2022-02-20 18:25:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4951 transitions. [2022-02-20 18:25:03,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:03,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:03,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:03,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have 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,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4950 transitions. [2022-02-20 18:25:04,034 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4950 transitions. Word has length 72 [2022-02-20 18:25:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:04,034 INFO L470 AbstractCegarLoop]: Abstraction has 3124 states and 4950 transitions. [2022-02-20 18:25:04,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4950 transitions. [2022-02-20 18:25:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:04,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:04,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:04,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:25:04,035 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -808156936, now seen corresponding path program 1 times [2022-02-20 18:25:04,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:04,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707507446] [2022-02-20 18:25:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:04,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {49775#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(37, 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; {49775#true} is VALID [2022-02-20 18:25:04,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {49775#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; {49775#true} is VALID [2022-02-20 18:25:04,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {49775#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {49775#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {49775#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {49775#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {49775#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {49775#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {49775#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {49775#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {49775#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {49775#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {49775#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {49775#true} is VALID [2022-02-20 18:25:04,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {49775#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {49775#true} assume ~id1~0 != ~id2~0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {49775#true} assume ~id1~0 != ~id3~0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {49775#true} assume ~id2~0 != ~id3~0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {49775#true} assume ~id1~0 >= 0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {49775#true} assume ~id2~0 >= 0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {49775#true} assume ~id3~0 >= 0; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {49775#true} assume 0 == ~r1~0 % 256; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {49775#true} assume 0 == ~r2~0 % 256; {49775#true} is VALID [2022-02-20 18:25:04,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {49775#true} assume 0 == ~r3~0 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {49775#true} assume 0 != init_~r122~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {49775#true} assume 0 != init_~r132~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {49775#true} assume 0 != init_~r212~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {49775#true} assume 0 != init_~r232~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {49775#true} assume 0 != init_~r312~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {49775#true} assume 0 != init_~r322~0#1 % 256; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {49775#true} assume ~max1~0 == ~id1~0; {49775#true} is VALID [2022-02-20 18:25:04,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {49775#true} assume ~max2~0 == ~id2~0; {49775#true} is VALID [2022-02-20 18:25:04,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {49775#true} assume ~max3~0 == ~id3~0; {49775#true} is VALID [2022-02-20 18:25:04,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {49775#true} assume 0 == ~st1~0; {49775#true} is VALID [2022-02-20 18:25:04,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {49775#true} assume 0 == ~st2~0; {49775#true} is VALID [2022-02-20 18:25:04,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {49775#true} assume 0 == ~st3~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:04,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl1~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:04,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl2~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:04,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl3~0; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {49778#(<= (+ ~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; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {49778#(<= (+ ~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; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {49778#(<= (+ ~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; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:04,089 INFO L290 TraceCheckUtils]: 67: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {49776#false} is VALID [2022-02-20 18:25:04,089 INFO L290 TraceCheckUtils]: 68: Hoare triple {49776#false} check_#res#1 := check_~tmp~1#1; {49776#false} is VALID [2022-02-20 18:25:04,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {49776#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; {49776#false} is VALID [2022-02-20 18:25:04,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {49776#false} assume 0 == assert_~arg#1 % 256; {49776#false} is VALID [2022-02-20 18:25:04,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {49776#false} assume !false; {49776#false} is VALID [2022-02-20 18:25:04,089 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:25:04,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:04,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707507446] [2022-02-20 18:25:04,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707507446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:04,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:04,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:04,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803614893] [2022-02-20 18:25:04,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:04,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:04,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:04,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:04,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:04,130 INFO L87 Difference]: Start difference. First operand 3124 states and 4950 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:09,120 INFO L93 Difference]: Finished difference Result 9396 states and 15009 transitions. [2022-02-20 18:25:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:25:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:25:09,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:25:09,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:10,832 INFO L225 Difference]: With dead ends: 9396 [2022-02-20 18:25:10,832 INFO L226 Difference]: Without dead ends: 6460 [2022-02-20 18:25:10,835 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:25:10,843 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 361 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 661 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:25:10,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-02-20 18:25:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 4776. [2022-02-20 18:25:12,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:12,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have 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:12,569 INFO L74 IsIncluded]: Start isIncluded. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have 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:12,572 INFO L87 Difference]: Start difference. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have 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:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:13,668 INFO L93 Difference]: Finished difference Result 6460 states and 10278 transitions. [2022-02-20 18:25:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 10278 transitions. [2022-02-20 18:25:13,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:13,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:13,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 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 6460 states. [2022-02-20 18:25:13,681 INFO L87 Difference]: Start difference. First operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 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 6460 states. [2022-02-20 18:25:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:14,826 INFO L93 Difference]: Finished difference Result 6460 states and 10278 transitions. [2022-02-20 18:25:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 10278 transitions. [2022-02-20 18:25:14,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:14,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:14,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:14,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have 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:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 7564 transitions. [2022-02-20 18:25:15,504 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 7564 transitions. Word has length 72 [2022-02-20 18:25:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:15,505 INFO L470 AbstractCegarLoop]: Abstraction has 4776 states and 7564 transitions. [2022-02-20 18:25:15,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 7564 transitions. [2022-02-20 18:25:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:15,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:15,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:15,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:25:15,506 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1968035874, now seen corresponding path program 1 times [2022-02-20 18:25:15,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:15,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139388239] [2022-02-20 18:25:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:15,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {78707#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(37, 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; {78707#true} is VALID [2022-02-20 18:25:15,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {78707#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; {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {78707#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {78707#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {78707#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {78707#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {78707#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {78707#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {78707#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {78707#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {78707#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {78707#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {78707#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {78707#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {78707#true} assume ~id1~0 != ~id2~0; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {78707#true} assume ~id1~0 != ~id3~0; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {78707#true} assume ~id2~0 != ~id3~0; {78707#true} is VALID [2022-02-20 18:25:15,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {78707#true} assume ~id1~0 >= 0; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {78707#true} assume ~id2~0 >= 0; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {78707#true} assume ~id3~0 >= 0; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {78707#true} assume 0 == ~r1~0 % 256; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {78707#true} assume 0 == ~r2~0 % 256; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {78707#true} assume 0 == ~r3~0 % 256; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {78707#true} assume 0 != init_~r122~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {78707#true} assume 0 != init_~r132~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {78707#true} assume 0 != init_~r212~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {78707#true} assume 0 != init_~r232~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {78707#true} assume 0 != init_~r312~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {78707#true} assume 0 != init_~r322~0#1 % 256; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {78707#true} assume ~max1~0 == ~id1~0; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {78707#true} assume ~max2~0 == ~id2~0; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {78707#true} assume ~max3~0 == ~id3~0; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {78707#true} assume 0 == ~st1~0; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {78707#true} assume 0 == ~st2~0; {78707#true} is VALID [2022-02-20 18:25:15,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {78707#true} assume 0 == ~st3~0; {78707#true} is VALID [2022-02-20 18:25:15,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {78707#true} assume 0 == ~nl1~0; {78707#true} is VALID [2022-02-20 18:25:15,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {78707#true} assume 0 == ~nl2~0; {78707#true} is VALID [2022-02-20 18:25:15,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {78707#true} assume 0 == ~nl3~0; {78707#true} is VALID [2022-02-20 18:25:15,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {78707#true} assume 0 == ~mode1~0 % 256; {78707#true} is VALID [2022-02-20 18:25:15,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {78707#true} assume 0 == ~mode2~0 % 256; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {78709#(= (+ (* (- 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; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {78709#(= (+ (* (- 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; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {78709#(= (+ (* (- 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; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {78708#false} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {78708#false} assume !(255 == ~r2~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {78708#false} ~r2~0 := 1 + ~r2~0 % 256; {78708#false} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {78708#false} assume !(0 != ~ep12~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {78708#false} assume !(0 != ~ep32~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {78708#false} assume 2 == ~r2~0 % 256; {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {78708#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {78708#false} ~mode2~0 := 0; {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {78708#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {78708#false} assume !(0 != ~mode3~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {78708#false} assume ~r3~0 % 256 < 2; {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {78708#false} assume !(0 != ~ep31~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {78708#false} assume !(0 != ~ep32~0 % 256); {78708#false} is VALID [2022-02-20 18:25:15,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {78708#false} ~mode3~0 := 1; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {78708#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; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {78708#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {78708#false} check_#res#1 := check_~tmp~1#1; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {78708#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; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 70: Hoare triple {78708#false} assume 0 == assert_~arg#1 % 256; {78708#false} is VALID [2022-02-20 18:25:15,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {78708#false} assume !false; {78708#false} is VALID [2022-02-20 18:25:15,588 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:25:15,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:15,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139388239] [2022-02-20 18:25:15,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139388239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:15,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:15,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:25:15,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800598061] [2022-02-20 18:25:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:15,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:15,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:15,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:15,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:25:15,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:25:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:25:15,626 INFO L87 Difference]: Start difference. First operand 4776 states and 7564 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:21,526 INFO L93 Difference]: Finished difference Result 10472 states and 16650 transitions. [2022-02-20 18:25:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:25:21,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:21,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:25:21,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:23,373 INFO L225 Difference]: With dead ends: 10472 [2022-02-20 18:25:23,373 INFO L226 Difference]: Without dead ends: 7115 [2022-02-20 18:25:23,376 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:25:23,377 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 102 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 443 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:25:23,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-02-20 18:25:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7113. [2022-02-20 18:25:26,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:26,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have 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:26,076 INFO L74 IsIncluded]: Start isIncluded. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have 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:26,080 INFO L87 Difference]: Start difference. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have 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:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:27,412 INFO L93 Difference]: Finished difference Result 7115 states and 11204 transitions. [2022-02-20 18:25:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 11204 transitions. [2022-02-20 18:25:27,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:27,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:27,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 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 7115 states. [2022-02-20 18:25:27,429 INFO L87 Difference]: Start difference. First operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 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 7115 states. [2022-02-20 18:25:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:28,699 INFO L93 Difference]: Finished difference Result 7115 states and 11204 transitions. [2022-02-20 18:25:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 11204 transitions. [2022-02-20 18:25:28,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:28,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:28,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:28,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have 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:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 11203 transitions. [2022-02-20 18:25:30,228 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 11203 transitions. Word has length 72 [2022-02-20 18:25:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:30,228 INFO L470 AbstractCegarLoop]: Abstraction has 7113 states and 11203 transitions. [2022-02-20 18:25:30,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 11203 transitions. [2022-02-20 18:25:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:30,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:30,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:30,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:30,229 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 952039085, now seen corresponding path program 1 times [2022-02-20 18:25:30,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:30,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096651323] [2022-02-20 18:25:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:30,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {112984#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(37, 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; {112984#true} is VALID [2022-02-20 18:25:30,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {112984#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; {112984#true} is VALID [2022-02-20 18:25:30,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {112984#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {112984#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {112984#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {112984#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {112984#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {112984#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {112984#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {112984#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {112984#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {112984#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {112984#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {112984#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {112984#true} assume ~id1~0 != ~id2~0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {112984#true} assume ~id1~0 != ~id3~0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {112984#true} assume ~id2~0 != ~id3~0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {112984#true} assume ~id1~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {112984#true} assume ~id2~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {112984#true} assume ~id3~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:30,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {112984#true} assume 0 == ~r1~0 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {112984#true} assume 0 == ~r2~0 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {112984#true} assume 0 == ~r3~0 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {112984#true} assume 0 != init_~r122~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {112984#true} assume 0 != init_~r132~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {112984#true} assume 0 != init_~r212~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {112984#true} assume 0 != init_~r232~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {112984#true} assume 0 != init_~r312~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {112984#true} assume 0 != init_~r322~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {112984#true} assume ~max1~0 == ~id1~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {112984#true} assume ~max2~0 == ~id2~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {112984#true} assume ~max3~0 == ~id3~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {112984#true} assume 0 == ~st1~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {112984#true} assume 0 == ~st2~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {112984#true} assume 0 == ~st3~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {112984#true} assume 0 == ~nl1~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {112984#true} assume 0 == ~nl2~0; {112984#true} is VALID [2022-02-20 18:25:30,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {112984#true} assume 0 == ~nl3~0; {112984#true} is VALID [2022-02-20 18:25:30,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {112984#true} assume 0 == ~mode1~0 % 256; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {112986#(= (+ (* (- 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; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {112986#(= (+ (* (- 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; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {112985#false} assume !(255 == ~r1~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {112985#false} ~r1~0 := 1 + ~r1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {112985#false} assume !(0 != ~ep21~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {112985#false} assume !(0 != ~ep31~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {112985#false} assume 2 == ~r1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {112985#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {112985#false} ~mode1~0 := 0; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {112985#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {112985#false} assume !(0 != ~mode2~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {112985#false} assume ~r2~0 % 256 < 2; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {112985#false} assume !(0 != ~ep21~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {112985#false} assume !(0 != ~ep23~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {112985#false} ~mode2~0 := 1; {112985#false} is VALID [2022-02-20 18:25:30,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {112985#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 61: Hoare triple {112985#false} assume !(0 != ~mode3~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {112985#false} assume ~r3~0 % 256 < 2; {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {112985#false} assume !(0 != ~ep31~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {112985#false} assume !(0 != ~ep32~0 % 256); {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {112985#false} ~mode3~0 := 1; {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {112985#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; {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {112985#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {112985#false} is VALID [2022-02-20 18:25:30,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {112985#false} check_#res#1 := check_~tmp~1#1; {112985#false} is VALID [2022-02-20 18:25:30,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {112985#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; {112985#false} is VALID [2022-02-20 18:25:30,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {112985#false} assume 0 == assert_~arg#1 % 256; {112985#false} is VALID [2022-02-20 18:25:30,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {112985#false} assume !false; {112985#false} is VALID [2022-02-20 18:25:30,280 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:25:30,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:30,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096651323] [2022-02-20 18:25:30,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096651323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:30,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:30,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:25:30,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645056817] [2022-02-20 18:25:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:30,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:30,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:30,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:30,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:25:30,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:30,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:25:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:25:30,317 INFO L87 Difference]: Start difference. First operand 7113 states and 11203 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:42,569 INFO L93 Difference]: Finished difference Result 15869 states and 25266 transitions. [2022-02-20 18:25:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:25:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:42,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:25:42,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:46,235 INFO L225 Difference]: With dead ends: 15869 [2022-02-20 18:25:46,235 INFO L226 Difference]: Without dead ends: 10691 [2022-02-20 18:25:46,239 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:25:46,240 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 108 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 464 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:25:46,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 464 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10691 states. [2022-02-20 18:25:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10691 to 10689. [2022-02-20 18:25:50,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:50,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10691 states. Second operand has 10689 states, 10688 states have (on average 1.5716691616766467) internal successors, (16798), 10688 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have 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:50,638 INFO L74 IsIncluded]: Start isIncluded. First operand 10691 states. Second operand has 10689 states, 10688 states have (on average 1.5716691616766467) internal successors, (16798), 10688 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have 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:50,649 INFO L87 Difference]: Start difference. First operand 10691 states. Second operand has 10689 states, 10688 states have (on average 1.5716691616766467) internal successors, (16798), 10688 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)